A decidable dense branching-time temporal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1974, Issue , 2000, Pages 139-150

  La Torre, Salvatore ^a,b   Napoli, Margherita ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; FORESTRY; SEMANTICS; SOFTWARE ENGINEERING; TEMPORAL LOGIC; TREES (MATHEMATICS);

BRANCHING TIME; EMPTINESS PROBLEM; FINITE SATISFIABILITY; SATISFIABILITY; TEMPORAL OPERATORS; TIMED COMPUTATION TREE LOGIC; TIMING CONSTRAINTS; UNDECIDABILITY;

FORMAL LOGIC;

EID: 84908371689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146, 1996.
4. R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104(1):35-77, 1993.
5. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of Workshop on Logic of Programs, LNCS 131, pages 52-71. Springer-Verlag, 1981.
6. M. Dickhofer and T. Wilke. Timed alternating tree automata: the automatatheoretic solution to the TCTL model checking problem. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming, LNCS 1644, pages 281-290. Springer-Verlag, 1999.
7. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publishers, 1990.
8. E.A. Emerson, A.K. Mok, A.P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Proceedings of the 2nd International Conference on Computer Aided Verification, LNCS 531, pages 136-145. Springer-Verlag, 1990.
9. T.A. Henzinger. It’s about time: Real-time logics reviewed. In Proceedings of the 9th International Conference on Concurrency Theory, CONCUR’98, LNCS 1466, pages 439-454. Springer-Verlag, 1998.
10. D. Harel and A. Pnueli. On the development of reactive systems. In Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477-498. Springer-Verlag, 1985.
11. F. Jahanian and A.K. Mok. Safety analysis of timing properties in real-time systems. IEEE Transactions on Software Engineering, SE - 12(9):890-904, 1986.
12. R. Koymans. Specifying real-time properties with metric temporal logic. Journal of Real-Time Systems, 2:255-299, 1990.
13. S. LaTorre and M. Napoli. Timed tree automata with an application to temporal logic. Technical report, Dipartimento di Informatica ed Applicazioni, Universit`a degli Studi di Salerno, Italy, 1997. URL:“http://www.cis.upenn.edu/∼latorre/Papers/stctl.ps.gz”.
14. A. Pnueli and E. Harel. Applications of temporal logic to the specification of real-time systems. In Formal Techniques in Real-time and Fault-tolerant Systems, LNCS 331, pages 84-98. Springer-Verlag, 1988.
15. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-77, 1977.
16. M.O. Rabin. Automata on infinite objects and Church’s problem. Trans. Amer. Math. Soc., 1972.
17. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. Elsevier Science Publishers, 1990. URL: “http://www.cis.upenn.edu/∼latorre/Papers/fsttcs.ps.gz”.