Abstract
We consider linear time temporal logic enriched with semi-extended regular expressions through various operators that have been proposed in the literature, in particular in Accelera’s Property Specification Language. We obtain results about the expressive power of fragments of this logic when restricted to certain operators only: basically, all operators alone suffice for expressive completeness w.r.t. ω-regular expressions, just the closure operator is too weak. We also obtain complexity results. Again, almost all operators alone suffice for EXPSPACE-completeness, just the closure operator needs some help.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Inc. Accellera Organization: Formal semantics of Accellera property specification language (2004). In Appendix B of http://www.eda.org/vfv/docs/PSL-v1.1.pdf
Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: POPL 1986. Conf. Record of the 13th Annual ACM Symp. on Principles of Programming Languages, pp. 173–183. ACM, New York (1986)
Bustan, D., Fisman, D., Havlicek, J.: Automata constructions for PSL. Technical Report MCS05-04, The Weizmann Institute of Science (2005)
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)
Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: The temporal analysis of fairness. In: POPL 1980. Proc. 7th Symp. on Principles of Programming Languages, pp. 163–173. ACM Press, New York (1980)
Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Annals of Pure and Applied Logic 96(1-3), 187–207 (1999)
Pnueli, A.: The temporal logic of programs. In: FOCS 1977. Proc. 18th Symp. on Foundations of Computer Science, Providence, RI, USA, pp. 46–57. IEEE Computer Society Press, Los Alamitos (1977)
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 177–192 (1970)
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)
Sistla, A.P., Vardi, M.Y., Wolper, P.: Reasoning about infinite computation paths. In: FOCS 1983. Proc. 24th Symp. on Foundations of Computer Science, pp. 185–194. IEEE Computer Society Press, Los Alamitos, CA, USA (1983)
Thomas, W.: Star-free regular sets of ω-sequences. Information and Control 42(2), 148–156 (1979)
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)
Vardi, M.Y.: A temporal fixpoint calculus. In: ACM (ed.) POPL 1988. Proc. Conf. on Principles of Programming Languages, pp. 250–259. ACM Press, NY, USA (1988)
Wolper, P.: Temporal logic can be more expressive. Information and Control 56, 72–99 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, M. (2007). Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. In: Caires, L., Vasconcelos, V.T. (eds) CONCUR 2007 – Concurrency Theory. CONCUR 2007. Lecture Notes in Computer Science, vol 4703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74407-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-74407-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74406-1
Online ISBN: 978-3-540-74407-8
eBook Packages: Computer ScienceComputer Science (R0)