References

  1. Luca Alberucci & Alessandro Facchini (2009): The modal μ-calculus over restricted classes of transition systems. J.\@m Symb.\@m Log.\@m 74(4), pp. 1367–1400, doi:10.2178/jsl/1254748696.
  2. Rajeev Alur & P. Madhusudan (2009): Adding Nesting Structure to Words. J.+.1667emACM 56(3), pp. 1–43, doi:10.1145/1516512.1516518.
  3. Marcelo Arenas, Pablo Barceló & Leonid Libkin (2011): Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. Theor.\@m Comput.\@m Syst.\@m 49(3), pp. 639–670, doi:10.1007/s00224-010-9292-5.
  4. André Arnold (1999): The modal μ-calculus alternation-depth is strict on binary trees. Theor. Inform. Appl. 33(4–5), pp. 329–339, doi:10.1051/ita:1999121.
  5. André Arnold & Damian Niwiński (2001): Rudiments of μ-calculus. Studies in Logic and the Foundations of Mathematics 146. North-Holland.
  6. Laura Bozzelli (2007): Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. In: CONCUR'07, Lect.\@m Notes Comput.\@m Sci.\@m 4703, pp. 476–491, doi:10.1007/978-3-540-74407-8_32.
  7. Julian C. Bradfield (1998): The modal mu-calculus alternation hierarchy is strict. Theoret.\@m Comput.\@m Sci.\@m 195(2), pp. 133–153, doi:10.1016/S0304-3975(97)00217-X.
  8. Julian C. Bradfield (1999): Fixpoint alternation: arithmetic, transition systems, and the binary tree. Theor. Inform. Appl. 33(4–5), pp. 341–356, doi:10.1051/ita:1999122.
  9. Giovanna D'Agostino & Giacomo Lenzi (2010): On the μ-calculus over transitive and finite transitive frames. Theoret.\@m Comput.\@m Sci.\@m 411(50), pp. 4273–4290, doi:10.1016/j.tcs.2010.09.002.
  10. Anuj Dawar & Martin Otto (2009): Modal characterisation theorems over special classes of frames. Ann. Pure Appl. Logic 161(1), pp. 1–42, doi:10.1016/j.apal.2009.04.002.
  11. E. Allen Emerson & Charanjit S. Jutla (1991): Tree Automata, Mu-Calculus and Determinacy. In: FOCS'91, pp. 368–377, doi:10.1109/SFCS.1991.185392.
  12. E. Allen Emerson & Chin-Laung Lei (1986): Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In: LICS'86, pp. 267–278.
  13. David Janin & Igor Walukiewicz (1996): On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. In: CONCUR'96, Lect.\@m Notes Comput.\@m Sci.\@m 1119, pp. 263–277, doi:10.1007/3-540-61604-7_60.
  14. Roope Kaivola (1995): Axiomatising Linear Time Mu-calculus. In: CONCUR'95, Lect.\@m Notes Comput.\@m Sci.\@m 962, pp. 423–437, doi:10.1007/3-540-60218-6_32.
  15. Dexter Kozen (1983): Results on the Propositional μ-Calculus. Theoret.\@m Comput.\@m Sci.\@m 27(3), pp. 333––354, doi:10.1016/0304-3975(82)90125-6.
  16. Orna Kupferman & Moshe Y. Vardi (1998): Weak Alternating Automata and Tree Automata Emptiness. In: STOC'98, pp. 224–233, doi:10.1145/276698.276748.
  17. Orna Kupferman & Moshe Y. Vardi (2001): Weak Alternating Automata Are Not that Weak. ACM Trans.\@m Comput.\@m Log.\@m 2(3), pp. 408–429, doi:10.1145/377978.377993.
  18. Orna Kupferman & Moshe Y. Vardi (2005): From Linear Time to Branching Time. ACM Trans.\@m Comput.\@m Log.\@m 6(2), pp. 273–294, doi:10.1145/1055686.1055689.
  19. Giacomo Lenzi (1996): A Hierarchy Theorem for the μ-Calculus. In: ICALP'96, Lect.\@m Notes Comput.\@m Sci.\@m 1099, pp. 87–97, doi:10.1007/3-540-61440-0_119.
  20. Radu Mateescu (2002): Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems. In: TACAS'02, Lect.\@m Notes Comput.\@m Sci.\@m 2280, pp. 281–295, doi:10.1007/3-540-46002-0_20.
  21. David E. Muller & Paul E. Schupp (1987): Alternating Automata on Infinite Trees. Theoret.\@m Comput.\@m Sci.\@m 54(2–3), pp. 267–276, doi:10.1016/0304-3975(87)90133-2.
  22. Damian Niwiński (1986): On fixed-point clones. In: ICALP'86, Lect.\@m Notes Comput.\@m Sci.\@m 226, pp. 464–473, doi:10.1007/3-540-16761-7_96.
  23. Damian Niwiński (1988): Fixed points vs. infinite generation. In: LICS'88, pp. 402–409, doi:10.1109/LICS.1988.5137.
  24. Igor Walukiewicz (1995): Completeness of Kozen's Axiomatization of the Propositional μ-Calculus. In: LICS'95, pp. 14–24, doi:10.1109/LICS.1995.523240.
  25. Thomas Wilke (2001): Alternating Tree Automata, Parity Games, and Modal μ-Calculus. Bull.\@m Soc.\@m Math.\@m Belg.\@m 8(2), pp. 359–391.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org