Counting on CTL*: On the expressive power of monadic path logic

Information and Computation

Volumn 184, Issue 1, 2003, Pages 147-159

  Moller, Faron ^a   Rabinovich, Alexander ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; EQUIVALENCE CLASSES; GAME THEORY; THEOREM PROVING;

BRANCHING TIME LOGIC; COMPOSITION THEOREM; MONADIC PATH LOGIC; MONADIC SECOND ORDER LOGIC; TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0038127220     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00104-4     Document Type: Article

References (26)

1. A. Abdelwaheb, D. Basin, Bounded model construction for monadic second-order logics, in: Proceedings of CAV'00: International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, vol. 1855, Springer-Verlag, Berlin, 2000, pp. 99-113.
2. J.F.A.K. van Benthem, Modal Correspondence Theory. PhD Thesis. Mathematisch Instituut and Instituut voor Grondslagenonderzoek, University of Amsterdam (1976).
3. E.M. Clarke, E.A. Emerson, Design and verification of synchronous skeletons using branching time temporal logic, Lecture Notes in Computer Science 131 (1981) 52-71.
4. H.-D. Ebbinghaus, J. Flum, Finite Model Theory, Springer Perspectives in Mathematical Logic (1995).
5. E.A. Emerson, J.Y. Halpern, 'Sometimes' and 'not never' revisited: on branching versus linear time temporal logics, Journal of the ACM 33 (1) (1986) 151-178.
6. S. Feferman, R.L. Vaught, The first-order properties of products of algebraic systems, Fundamenta Mathematica 47 (1959) 57-103.
7. D. Gabbay, I. Hodkinson, M. Reynolds, Temporal Logic, Oxford University Press, Oxford, 1994.
8. D. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: 7th Annual Symposium on Principles of Programming Languages, 1980, pp. 163-173.
9. Y. Gurevich, Modest theory of short chains I, Journal of Symbolic Logic 44 (1979) 481-490.
10. Y. Gurevich, Monadic second-order theories, in: J. Barwise, S. Feferman (Eds.), Model-Theoretic Logics, Springer-Verlag, Berlin, 1985, pp. 479-506.
11. Y. Gurevich, S. Shelah, Modest theory of short chains II, Journal of Symbolic Logic 44 (1979) 491-502.
12. Y. Gurevich, S. Shelah, Rabin's uniformization problem, Journal of Symbolic Logic 48 (1979) 1105-1119.
13. Y. Gurevich, S. Shelah, To the decision problem for branching time logic, in: P. Weingartner, G. Dorn (Eds.), Foundations of Logic and Linguistics: Problems and their Solutions, Plenum, New York, 1985, pp. 181-198.
14. Y. Gurevich, S. Shelah, The decision problem for branching time logic, Journal of Symbolic Logic 50 (3) (1985) 668-681.
15. T. Hafer, W. Thomas, Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree, in: Proceedings of ICALP'87: International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 267, Springer-Verlag, Berlin, 1987, pp. 269-279.
16. W. Hodges, Model Theory, Cambridge University Press, Cambridge, 1993.
17. I. Hodkinson, Expressive completeness of Until and Since over dedekind complete linear time, in: A. Ponse, M. de Rijke, Y. Venema (Eds.), Modal Logic and Process Algebra: A Bisimulation Perspective, CSLI Publications, 1995, pp. 171-185.
18. D. Janin, I. Walukiewicz, On the expressive completeness of the propositional μ-calculus with respect to monadic second-order logic, in: Proceedings of CONCUR'96: International Conference on Concurrency Theory, Lecture Notes in Computer Science, vol. 1119, Springer-Verlag, Berlin, 1996, pp. 263-277.
19. H.W. Kamp, Tense Logic and the Theory of Linear Order, PhD Thesis, University of California, Los Angeles (1968).
20. H. Läuchli, A decision procedure for the weak second-order theory of linear order, in: Contributions to Mathematical Logic, Proceedings of Logic Colloquium Hanover 1966, North-Holland, Amsterdam, 1968.
21. R. McNaughton, S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA, 1971.
22. F. Moller, A. Rabinovich, On the expressive power of CTL*, in: Proceedings of LICS'99: The fourteenth IEEE Symposium on Logic in Computer Science (1999) 360-369.
23. S. Shellah, The monadic theory of order, Annals of Mathematics 102 (1975) 379-419.
24. W. Thomas, Ehrenfeucht games, the composition method, and the monadic theory of ordinal words, in: Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht, Lecture Notes in Computer Science, vol. 1261, Springer-Verlag, Berlin, 1997, pp. 118-143.
25. I. Walukiewicz, Monadic second-order logic on tree-like structures, in: Proceedings of STACS'96: International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1046, Springer-Verlag, Berlin, 1996, pp. 401-414.
26. I. Walukiewicz, Personal Communication (2001).