Regular linear temporal logic

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

Volumn 4711 LNCS, Issue , 2007, Pages 291-305

  Leucker, Martin ^a   Sánchez, César ^b,c  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b Stanford University   (United States)

^c University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LINEAR PROGRAMMING; PROBLEM SOLVING; TRANSLATION (LANGUAGES);

ALGEBRAIC SIGNATURE; LINEAR TEMPORAL LOGIC;

TEMPORAL LOGIC;

EID: 38049105804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75292-9_20     Document Type: Conference Paper

References (27)

1. IEEE P1850 - Standard for PSL - Property Specification Language (September 2005)
2. Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: POPL'86. Procs. of the 13th Annual ACM Symp. on Principles of Programming Languages, pp. 173-183. ACM Press, New York (1986)
3. Beer, I., Ben-David, S., Eisner, C., Fisman, D., Gringauze, A., Rodeh, Y.: The temporal logic Sugar. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 363-367. Springer, Heidelberg (2001)
4. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. of the Int'l Congress on Logic Methodology and Philosophy of Science, pp. 1-12. Stanford University Press (1962)
5. Emerson, E.A., Clarke, E.M.: Characterizing correctness properties of parallel programs using fixpoints. In: de Bakker, J.W., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 169-181. Springer, Heidelberg (1980)
6. Fisman, D., Eisner, C., Havlicek, J.: Formal syntax and Semantics of PSL: Appendix B of Accellera Property Language Reference Manual, Version 1.1 (March 2004)
7. Harel, D., Peleg, D.: Process logic with regular formulas. Theoretical Computer Science 38, 307-322 (1985)
8. Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Annals of Pure and Applied Logic 96(1-3), 187-207 (1999)
9. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)
10. Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic finite automata. In: Reischuk, R., Morvan, M. (eds.) STACS 97. LNCS, vol. 1200, pp. 55-66. Springer, Heidelberg (1997)
11. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, vol. 34, pp. 3-41. Princeton University Press, Princeton, New Jersey (1956)
12. Kozen, D.: Results on the propositional μ-calculus. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol. 140, pp. 348-359. Springer, Heidelberg (1982)
13. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. In: ISTCS'97. Proc. of the Fifth Israel Symposium on Theory of Computing and Systems, pp. 147-158. IEEE Computer Society Press, Los Alamitos (1997)
14. Lange, M.: Weak automata for the linear time μ-calculus. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 267-281. Springer, Heidelberg (2005)
15. Lange, M., Stirling, C.: Model checking fixed point logic with chop. In: Nielsen, M., Engberg, U. (eds.) ETAPS 2002 and FOSSACS 2002. LNCS, vol. 2303, Springer, Heidelberg (2002)
16. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Springer, Heidelberg (1995)
17. Muller, D.E., Schupp, P.E.: Altenating automata on infinite trees. Theoretical Computer Science 54, 267-276 (1987)
18. Müller-Olm, M.: A modal fixpoint logic with chop. In: Meinel, C., Tison, S. (eds.) STACS 99. LNCS, vol. 1563, pp. 510-520. Springer, Heidelberg (1999)
19. Pnueli, A.: The temporal logic of programs. In: FOCS'77. Proc. of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46-67. IEEE Computer Society Press, Los Alamitos (1977)
20. Pnueli, A.: Applications of temporal logic to the specification and verification of reactive systems - a survey of current trends. In: Rozenberg, G., de Bakker, J.W., de Roever, W.-P. (eds.) Current Trends in Concurrency. LNCS, vol. 224, pp. 510-584. Springer, Heidelberg (1986)
21. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear termporal logics. Journal of the ACM 32(3), 733-749 (1985)
22. Stockmeyer, L.J.: The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, Department of Electrical Engineering, MIT, Boston, Massachusetts (1974)
23. Vardi, M.Y.: Personal communication
24. Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238-266. Springer, Heidelberg (1996)
25. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115, 1-37 (1994)
26. Wolper, P.: Temporal logic can be more expressive. Information and Control 56, 72-99 (1983)
27. Yamamoto, H.: On the power of input-synchronized alternating finite automata. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, p. 457. Springer, Heidelberg (2000)