Linear time logics around PSL: Complexity, expressiveness, and a little bit of succinctness

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

Volumn 4703 LNCS, Issue , 2007, Pages 90-104

  Lange, Martin ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SPECIFICATION LANGUAGES;

CLOSURE OPERATOR; LINEAR TIME TEMPORAL LOGIC; SEMIEXTENDED REGULAR EXPRESSIONS;

FUZZY LOGIC;

EID: 38149141606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74407-8_7     Document Type: Conference Paper

References (14)

1. Inc. Accellera Organization: Formal semantics of Accellera property specification language (2004) In Appendix B of http://www.eda.org/vfv/docs/PSL- vl. 1.pdf
2. Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: POPL'86. Conf. Record of the 13th Annual ACM Symp. on Principles of Programming Languages, pp. 173-183. ACM, New York (1986)
3. Bustan, D., Fisman, D., Havlicek, J.: Automata constructions for PSL. Technical Report MCS05-04, The Weizmann Institute of Science (2005)
4. Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30, 1-24 (1985)
5. Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: The temporal analysis of fairness. In: POPL'80. Proc. 7th Symp. on Principles of Programming Languages, pp. 163-173. ACM Press, New York (1980)
6. Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Annals of Pure and Applied Logic 96(1-3), 187-207 (1999)
7. Pnueli, A.: The temporal logic of programs. In: FOCS'77. Proc. 18th Symp. on Foundations of Computer Science, Providence, RI, USA, pp. 46-57. IEEE Computer Society Press, Los Alamitos (1977)
8. Savitch, W. J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 177-192 (1970)
9. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of the Association for Computing Machinery 32(3), 733-749 (1985)
10. Sistla, A.P., Vardi, M.Y., Wolper, P.: Reasoning about infinite computation paths. In: FOCS'83. Proc. 24th Symp. on Foundations of Computer Science, pp. 185-194. IEEE Computer Society Press, Los Alamitos, CA, USA (1983)
11. Thomas, W.: Star-free regular sets of w-sequences. Information and Control 42(2), 148-156 (1979)
12. van Emde Boas, P.: The convenience of tilings. In: Sorbi, A. (ed.) Complexity, Logic, and Recursion Theory. Lecture notes in pure and applied mathematics, vol. 187, pp. 331-363. Marcel Dekker, Inc. (1997)
13. Vardi, M.Y.: A temporal fixpoint calculus. In: ACM (ed.) POPL'88. Proc. Conf. on Principles of Programming Languages, pp. 250-259. ACM Press, NY, USA (1988)
14. Wolper, P.: Temporal logic can be more expressive. Information and Control 56, 72-99 (1983)