Weak automata for the linear time μ-calculus

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 267-281

  Lange, Martin ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; LINEAR SYSTEMS; OPTIMIZATION;

CALCULUS; HIERARCHY PROBLEM;

FINITE AUTOMATA;

EID: 24144479462     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_18     Document Type: Conference Paper

References (22)

1. H. Barringer, R. Kuiper, and A. Pnueli. A really abstract concurrent model and its temporal logic. In Proc. 13th Annual ACM Symp. on Principles of Programming Languages, pages 173-183. ACM, 1986.
2. H. Békic̀. Programming Languages and Their Definition, Selected Papers, volume 177 of LNCS. Springer, 1984.
3. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In R. Cleaveland, editor, Proc. 5th Int. Conf. on Tools and Algorithms for the Analysis and Construction of Systems, TACAS'99, volume 1579 of LNCS, Amsterdam, NL, March 1999.
4. J. C. Bradfield. The modal μ-calculus alternation hierarchy is strict. In U. Montanari and V. Sassone, editors, Proc. 7th Conf. on Concurrency Theory, CONCUR'96, volume 1119 of LNCS, pages 233-246, Pisa, Italy, August 1996. Springer.
5. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Congress on Logic, Method, and Philosophy of Science, pages 1-12, Stanford, CA, USA, 1962. Stanford University Press.
6. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.
7. S. Dziembowski, M. Jurdziński, and I. Walukiewicz. How much memory is needed to win infinite games? In Proc. 12th Symp. on Logic in Computer Science, LICS'97, pages 99-110, Warsaw, Poland, June 1997. IEEE.
8. E. A. Emerson. Model checking and the μ-calculus. In N. Immerman and P. G. Kolaitis, editors, Descriptive Complexity and Finite Models, volume 31 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, chapter 6. AMS, 1997.
9. E. A. Emerson and C. S. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd Symp. on Foundations of Computer Science, pages 368-377, San Juan, Puerto Rico, October 1991. IEEE.
10. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional μ-calculus with respect to monadic second order logic. In U. Montanari and V. Sassone, editors, Proc. 7th Conf. on Concurrency Theory, CONCUR'96, volume 1119 of LNCS, pages 263-277, Pisa, Italy, August 1996. Springer.
11. R. Kaivola. Using Automata to Characterise Fixed Point Temporal Logics. PhD thesis, LFCS, Division of Informatics, The University of Edinburgh, 1997. Tech. Rep. ECS-LFCS-97-356.
12. D. Kozen. Results on the propositional μ-calculus. TCS, 27:333-354, December 1983.
13. O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. ACM Transactions on Computational Logic, 2(3):408-429, 2001.
14. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
15. C. Löding and W. Thomas. Alternating automata and logics over infinite words. In Proc. IFIP Int. Conf. on Theoretical Computer Science, IFIP TCS2000, volume 1872 of LNCS, pages 521-535. Springer, August 2000.
16. D. Muller and P. Schupp. Alternating automata on infinite objects: determinacy and rabin's theorem. In M. Nivat and D. Perrin, editors, Proc. Ecole de Printemps d'Informatique Théoretique on Automata on Infinite Words, volume 192 of LNCS, pages 100-107, Le Mont Dore, France, May 1984. Springer.
17. D. E. Muller, A. Saoudi, and P. E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In Proc. 3rd Symp. on Logic in Computer Science, LICS'88, pages 422-427, Edinburgh, Scotland, July 1988. IEEE.
18. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. of Amer. Math. Soc., 141:1-35, 1969.
19. C. Stirling. Local model checking games. In I. Lee and S. A. Smolka, editors, Proc. 6th Conf. on Concurrency Theory, CONCUR'95, volume 962 of LNCS, pages 1-11, Berlin, Germany, August 1995. Springer.
20. M. Y. Vardi. A temporal fixpoint calculus. In ACM, editor, Proc. Conf. on Principles of Programming Languages, POPL'88, pages 250-259, NY, USA, 1988. ACM Press.
21. M. Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic, volume 1043 of LNCS, pages 238-266. Springer, New York, NY, USA, 1996.
22. I. Walukiewicz. Completeness of Kozen's axiomatization of the propositional μ-calculus. In Proc. 10th Symp. on Logic in Computer Science, LICS'95, pages 14-24, Los Alamitos, CA, 1995. IEEE.