Deterministic generators and games for LTL fragments

ACM Transactions on Computational Logic

Volumn 5, Issue 1, 2004, Pages 1-25

  Alur, Rajeev ^a,c   La Torre, Salvatore ^a,b,c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Automata; Games; Temporal Logic

Indexed keywords

AUTOMATA; GAMES; GENERATORS; TEMPORAL LOGIC;

AUTOMATA THEORY; BOOLEAN ALGEBRA; CALCULATIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; FORMAL LOGIC; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

GAME THEORY;

EID: 4444246434     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/963927.963928     Document Type: Article

References (22)

1. ALUR, R., ALFARO, L. DE, HENZINGER, T., AND MANG., F. 1999. Automating modular verification. In CONCUR'99: Concurrency Theory, Tenth International Conference, LNCS 1664, pages 82-97.
2. ALUR, R., HENZINGER, T. A., AND KUPFERMAN, O. 1997. Alternating-time temporal logic. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 100-109.
3. ALUR, R., HENZINGER, T., MANG, F., QADEER, S., RAJAMANI, S., AND TASIRAN, S. 1998. MOCHA: Modularity in model checking. In Proceedings of the 10th International Conference on Computer Aided Verification, LNCS 1427, pages 521-525. Springer-Verlag.
4. ABADI, M., LAMPORT, L. AND WOLPER, P. 1989. Realizable and unrealizable specifications of reactive systems. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming, ICALP'89, LNCS 372, pages 1-17.
5. DILL, D. L. 1989. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. ACM Distinguished Dissertation Series. MIT Press.
6. DEMRI, S. AND SCHNOEBELEN, PH. 1998. The complexity of propositional linear temporal logics in simple cases. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS'98, LNCS 1373, pages 61-72. Springer-Verlag.
7. EMERSON, E. A. AND JUTLA, C. S. 1988. The complexity of tree automata and logics of programs. In Proceedings of the 29th IEEE-CS Symposium on Foundations of Computer Science, pages 328-337.
8. EMERSON, E. A. 1990. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publishers.
9. KUPFERMAN, O. AND VARDI, M. Y. 1996. Module checking. In Computer Aided Verification, Proceedings of the Eighth International Workshop, LNCS 1102, pages 75-86. Springer-Verlag.
10. KUPFERMAN, O. AND VARDI, M. Y. 1997. Module checking revisited. In Proceedings of the 9th International Conference on Computer Aided Verification, CAV'97, LNCS 1254, pages 36-47.
11. KUPFERMAN, O. AND VARDI, M. Y. 1998. Freedom, weakness, and determinism: From linear-time to branching-time. In Proceedings of the 13th IEEE Symposium on Logic in Computer Science, pages 81-92.
12. LICHTENSTEIN, O. AND PNUELI, A. 1985. Checking that finite-state concurrent programs satisfy their linear specification. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pages 97-107.
13. MANNA, Z. AND PNUELI, A. 1991. The temporal logic of reactive and concurrent systems: Specification. Springer-verlag.
14. MARCINKOWSKI, J. AND TRUDERUNG, T. 2002. Optimal complexity bounds for positive LTL games. In Proceedings of the 16th Annual Conference of the European Association for Computer Science Logic, CSL'02. Springer-verlag.
15. PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-77.
16. PNUELI, A. AND ROSNER, R. 1989. On the synthesis of a reactive module. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 179-190.
17. RABIN, M. O. 1972. Automata on infinite objects and Church's problem. Trans. Amer. Math. Soc.
18. ROSNER, R. 1992. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science.
19. SAFRA, S. 1998. On the complexity of ω-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 319-327.
20. SISTLA, A. P. AND CLARKE, E. M. 1985. The complexity of propositional linear temporal logics. J. ACM, 32, 733-749.
21. THOMAS, W. 1995. On the synthesis of strategies in infinite games. In Ernst W. Mayr and Claude Puech, editors, 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS'95, LNCS 900, pages 1-13. Springer-Verlag.
22. VARDI, M. Y. AND WOLPER, P. 1994. Reasoning about infinite computations. Information and Computation, 115, 1-37.