The Horn mu-calculus

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 58-69

  Charatonik, Witold ^a,b   McAllester, David ^c   Niwínski, Damian ^d,e   Podelski, Andreas ^a   Walukiewicz, Igor ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

^c AT AND T LABS RESEARCH   (United States)

^d UNIVERSITY OF WARSAW   (Poland)

^e Visiting Max Planck Institut   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; COMPUTATIONAL COMPLEXITY; FORESTRY; LOGIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; TEMPORAL LOGIC;

ALGORITHMIC COMPLEXITY; ARBITRARY NESTING; CANONICAL SYSTEMS; GREATEST FIXED POINTS; LIVENESS PROPERTIES; RABIN TREE AUTOMATA; SET-BASED ANALYSIS; TRANSITION RULE;

COMPUTER CIRCUITS;

EID: 85018238784     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705643     Document Type: Conference Paper

References (26)

1. O. Bernholtz, M. Y. Vardi, and P. Wolper. An automata-Theoretic approach to branching-Time model checking. In Computer Aided Verification, Proc. 6th Int. Workshop, volume 818 of LNCS, pages 142-155, Stanford, California, June 1994. Springer-Verlag. Full version available from authors.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR' 97. LNCS 1243, 1997.
3. J. R. Buchi. Regular canonical systems. Archiv Mathematische Logik und Grundlagenforschung, 6:91-111, 1964. Reprint in Saunders Mac Lane, Dirk Siefkes, editors, The collected works of J. Richard Buchi, Springer-Verlag, 1990.
4. O. Burkart and B. Steffen. Composition, Decomposition and Model- Checking of Pushdown Processes. Nordic Journal of Computing, 2, 1995.
5. W. Charatonik and A. Podelski. Co-definite set constraints. In T. Nipkow, editor, Proceedings of the 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 211-225. Springer-Verlag, 1998.
6. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-state systems. In B. Steffen, editor, Proceedings of the First International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of LNCS, pages 358-375. Springer-Verlag, 1998.
7. P. Devienne, J.-M. Talbot, and S. Tison. Solving classes of set constraints with tree automata. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming - CP97, volume 1330 of LNCS, pages 68-83. Springer-Verlag, October 1997.
8. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS 91, 1991.
9. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science 9, www.elsevier.nl/locate/entcs, 13 pages, 1997.
10. T. Fruhwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 300-309, July 1991.
11. D. Harel and D. Raz. Deciding emptiness for stack automata on infinite trees. Information and Computation (formerly Information and Control), 113:278-299, 1994.
12. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197-209, January 1990.
13. Y. Hirschfeld, M. Jerrum, and F. Moller. A polynomial-Time algorithm for deciding equivalence of normed context-free processes. In 35th Annual Symposium on Foundations of Computer Science, pages 623-631. IEEE Computer Society Press, November 1994.
14. H. Huttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings, 6th Annual Symposium on Logic in Computer Science, pages 376-386. IEEE Computer Society Press, July 1991.
15. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of lisp-like structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244-256, January 1979.
16. R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149-184, 1993.
17. A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In A. Skowron, editor, Fifth Symposium on Computation Theory, volume 208 of LNCS, pages 157-168, 1984.
18. D. E. Muller and P. E. Schup. The theory of ends, pushdown automata, and second-order logic. Theoretical Comput. Sci., 37, 1985.
19. D. E. Muller and P. E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Comput. Sci., 141:69-107, 1995.
20. D. Niwínski. Fixed points vs. infinite generation. In LICS '88, pages 402-409, 1988.
21. D. Niwínski. Fixed points characterization of infinite behavior of finite state systems. Theoret. Comput. Sci., 189:1-69, 1997.
22. W. Peng and S. Purushothaman. Empty stack pushdown omega-Tree automata. In J.-C. Raoult, editor, Colloquium on Trees in Algebra and Programming, volume 581 of LNCS, pages 248-264. Springer- Verlag, February 1992.
23. J. C. Reynolds. Automatic computation of data set definitions. Information Processing, 68:456-461, 1969.
24. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. 1997.
25. I. Walukiewicz. Pushdown processes: Games and model checking. In CAV'96, volume 1102 of LNCS, pages 62-74, 1996.
26. W. Zielonka. Infinite games on fintely coloured graphs with applications to automata on infinte trees. To appear in TCS, 1997.