Abstract
Linear Temporal Logic (LTL) interpreted on finite traces is a robust specification framework popular in formal verification. However, despite the high interest in the logic in recent years, the topic of their quantitative extensions is not yet fully explored. The main goal of this work is to study the effect of adding weak forms of percentage constraints (e.g. that most of the positions in the past satisfy a given condition, or that \(\sigma \) is the most-frequent letter occurring in the past) to fragments of LTL. Such extensions could potentially be used for the verification of influence networks or statistical reasoning. Unfortunately, as we prove in the paper, it turns out that percentage extensions of even tiny fragments of LTL have undecidable satisfiability and model-checking problems. Our undecidability proofs not only sharpen most of the undecidability results on logics with arithmetics interpreted on words known from the literature, but also are fairly simple. We also show that the undecidability can be avoided by restricting the allowed usage of the negation, and discuss how the undecidability results transfer to first-order logic on words.
Chapter PDF
Similar content being viewed by others
References
Jorge A. Baier, Sheila A. McIlraith: Planning with First-Order Temporally Extended Goals using Heuristic Search. In: AAAI (2006)
Shaull Almagor, Udi Boker, Orna Kupferman: Discounting in LTL. In: TACAS (2014). https://doi.org/10.1007/978-3-642-54862-8_37
Rajeev Alur, Thomas A. Henzinger: Real-Time Logics: Complexity and Expressiveness. Inf. Comput. (1993)
Bednarczyk, B., Michaliszyn, J.: “most of” leads to undecidability: Failure of adding frequencies to LTL https://arxiv.org/abs/2007.01233
Christoph Behle, Andreas Krebs: Regular Languages inMAJ\([>]\) with three variables. ECCC (2011)
Christoph Behle, Andreas Krebs, Stephanie Reifferscheid: Regular Languages Definable by Majority Quantifiers with Two Variables. In: DLT (2009). https://doi.org/10.1007/978-3-642-02737-6_7
Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman: Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. (2014). https://doi.org/10.1145/2629686
Benedikt Bollig, Normann Decker, Martin Leucker: Frequency Linear-time Temporal Logic. In: TASE (2012). https://doi.org/10.1109/TASE.2012.43
Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel: Averaging in LTL. In: CONCUR (2014). https://doi.org/10.1007/978-3-662-44584-6_19
Büchi, J.R.: Weak Second-Order Arithmetic and Finite Automata. Mathematical Logic Quarterly (1960). https://doi.org/10.1002/malq.19600060105
Cadilhac, M., Finkel, A., McKenzie, P.: Affine Parikh automata. RAIRO Theor. Informatics Appl. (2012). https://doi.org/10.1051/ita/2012013
Witold Charatonik, Piotr Witkowski: Two-variable Logic with Counting and a Linear Order. Logical Methods in Computer Science (2016). https://doi.org/10.2168/LMCS-12(2:8)2016
Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma: Model-Checking Counting Temporal Logics on Flat Structures. In: CONCUR (2017). https://doi.org/10.4230/LIPIcs.CONCUR.2017.29
Stéphane Demri: LTL over integer periodicity constraints. Theor. Comput. Sci. (2006). https://doi.org/10.1016/j.tcs.2006.02.019
Demri, S., Goranko, V., Lange, M.: Temporal Logics in Computer Science: Finite-State Systems. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (2016). https://doi.org/10.1017/CBO9781139236119
Kousha Etessami, Moshe Y. Vardi, Thomas Wilke: First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. (2002). https://doi.org/10.1006/inco.2001.2953
Diego Figueira, Leonid Libkin: Path Logics for Querying Graphs: Combining Expressiveness and Efficiency. In: LICS (2015). https://doi.org/10.1109/LICS.2015.39
Giuseppe De Giacomo, Moshe Y. Vardi: Linear Temporal Logic and Linear Dynamic Logic on Finite Traces. In: IJCAI (2013)
Giuseppe De Giacomo, Moshe Y. Vardi: Synthesis for LTL and LDL on Finite Traces. In: IJCAI (2015)
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger Olderog: Kleene, Rabin, and Scott Are Available. In: CONCUR (2010). https://doi.org/10.1007/978-3-642-15375-4_32
Felix Klaedtke, Harald Rueß: Monadic Second-Order Logics with Cardinalities. In: ICALP (2003). https://doi.org/10.1007/3-540-45061-0_54
Andreas Krebs: Typed semigroups, majority logic, and threshold circuits. Ph.D. thesis, University of Tübingen, Germany (2008)
Klaus-Jörn Lange: Some Results on Majority Quantifier sover Words. In: CCC (2004). https://doi.org/10.1109/CCC.2004.1313817
François Laroussinie, Antoine Meyer, Eudes Petonnet: Counting LTL. In: TIME (2010). https://doi.org/10.1109/TIME.2010.20
Kamal Lodaya, Sreejith, A.V.: Two-Variable First Order Logic with Counting Quantifiers: Complexity Results. In: DLT (2017). https://doi.org/10.1007/978-3-319-62809-7_19
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation, Prentice-Hall (1967)
Matthias Niewerth: Data definition languages for XML repository management systems. Ph.D. thesis, Technical University of Dortmund, Germany (2016)
Joël Ouaknine, James Worrell: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science (2007)
Amir Pnueli: The Temporal Logic of Programs. In: FOCS (1977). https://doi.org/10.1109/SFCS.1977.32
Acknowledgements
Bartosz Bednarczyk was supported by the Polish Ministry of Science and Higher Education program “Diamentowy Grant” no. DI2017 006447. Jakub Michaliszyn was supported by NCN grant no. 2017/27/B/ST6/00299.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2021 The Author(s)
About this paper
Cite this paper
Bednarczyk, B., Michaliszyn, J. (2021). “Most of” leads to undecidability: Failure of adding frequencies to LTL. In: Kiefer, S., Tasson, C. (eds) Foundations of Software Science and Computation Structures. FOSSACS 2021. Lecture Notes in Computer Science(), vol 12650. Springer, Cham. https://doi.org/10.1007/978-3-030-71995-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-71995-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-71994-4
Online ISBN: 978-3-030-71995-1
eBook Packages: Computer ScienceComputer Science (R0)