Abstract
It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be extended to increase the expressiveness of the logic to all regular languages. Other ways of extending the expressiveness of LTL using modular and group modalities have been explored by Baziramwabo, McKenzie and Thérien, which are expressively complete for regular languages recognized by solvable monoids and for all regular languages, respectively. In all the papers mentioned, the numeric constants used in the modalities are in unary notation. We show that in some cases (such as the modular and symmetric group modalities and for threshold counting) we can use numeric constants in binary notation, and still maintain the Pspace upper bound. Adding modulo counting to LTL[F] (with just the unary future modality) already makes the logic Pspace-hard. We also consider a restricted logic which allows only the modulo counting of length from the beginning of the word. Its satisfiability is \(\Sigma^P_3\)-complete.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baziramwabo, A., McKenzie, P., Thérien, D.: Modular temporal logic. In: Proc. 14th LICS, p. 344. IEEE, Los Alamitos (1999)
Emerson, E.A., Clarke Jr., E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comp. Program. 2, 241–266 (1982)
Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279–295 (2002)
Fine, K.: Propositional quantifiers in modal logic. Theoria 36, 336–346 (1970)
Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comp. Syst. Sci. 18(2), 194–211 (1979)
Harel, D., Kozen, D.C., Parikh, R.J.: Process logic: expressiveness, decidability, completeness. J. Comp. Syst. Sci. 25, 144–170 (1982)
Harel, D., Sherman, R.: Dynamic logic of flowcharts. Inf. Contr. 64(1-3), 119–135 (1985)
Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Ann. Pure Appl. Logic 96(1-3), 187–207 (1999)
Herstein, I.N.: Topics in Algebra. Blaisdell (1964)
Kamp, J.A.W.: Tense logic and the theory of linear order. PhD thesis, University of California, Los Angeles (1968)
Laroussinie, F., Meyer, A., Petonnet, E.: Counting LTL. In: Proc. Time (to appear 2010)
Ono, H., Nakamura, A.: On the size of refutation kripke models for some linear modal and tense logics. Studia Logica: An International Journal for Symbolic Logic 39(4), 325–333 (1980)
Schnoebelen, P.: The complexity of temporal logic model checking. In: Proc. 4th Adv. Modal Log., Toulouse, pp. 393–436. King’s College (2003)
Schützenberger, M.-P.: On finite monoids having only trivial subgroups. Inf. Contr. 8, 190–194 (1965)
Serre, O.: Vectorial languages and linear temporal logic. Theoret. Comp. Sci. 310(1-3), 79–116 (2004)
Sistla, A.P., Clarke Jr., E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)
Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Basel (1994)
Straubing, H., Thérien, D., Thomas, W.: Regular languages defined with generalized quantifiers. Inf. Comput. 118(3), 289–301 (1995)
Vardi, M.Y.: From philosophical to industrial logics. In: Ramanujam, R., Sarukkai, S. (eds.) Logic and Its Applications. LNCS (LNAI), vol. 5378, pp. 89–115. Springer, Heidelberg (2009)
Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1–37 (1994)
Wolper, P.: Temporal logic can be more expressive. Inf. Contr. 56(1-2), 72–99 (1983)
Wolper, P., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths. In: Proc. 24th Found. Comp. Sci., Tucson, pp. 185–194. IEEE, Los Alamitos (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lodaya, K., Sreejith, A.V. (2010). LTL Can Be More Succinct. In: Bouajjani, A., Chin, WN. (eds) Automated Technology for Verification and Analysis. ATVA 2010. Lecture Notes in Computer Science, vol 6252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15643-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-15643-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15642-7
Online ISBN: 978-3-642-15643-4
eBook Packages: Computer ScienceComputer Science (R0)