On the Satisfiability of Indexed Linear Temporal Logics

Indexed Linear Temporal Logics (ILTL) are an extension of standard Linear Temporal Logics (LTL) with quantifications over index variables which range over a set of process identifiers. ILTL has been widely used in specifying and verifying properties of parameterised systems, e.g., in parameterised model checking of concurrent processes. However there is still a lack of theoretical investigations on properties of ILTL, compared to the well-studied LTL. In this paper, we start to narrow this gap, focusing on the satisfiability problem, i.e., to decide whether a model exists for a given formula. This problem is in general undecidable. Various fragments of ILTL have been considered in the literature typically in parameterised model checking, e.g., ILTL formulae in prenex normal form, or containing only non-nested quantifiers, or admitting limited temporal operators. We carry out a thorough study on the decidability and complexity of the satisfiability problem for these fragments. Namely, for each fragment, we either show that it is undecidable, or otherwise provide tight complexity bounds.

[1]  Thomas Schwentick,et al.  Temporal Logics on Words with Multiple Data Values , 2010, FSTTCS.

[2]  Orna Grumberg,et al.  A Game-Theoretic Approach to Simulation of Data-Parameterized Systems , 2014, ATVA.

[3]  Orna Grumberg,et al.  Model Checking Systems and Specifications with Parameterized Atomic Propositions , 2012, ATVA.

[4]  Fu Song,et al.  Extending Temporal Logics with Data Variable Quantifications , 2014, FSTTCS.

[5]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[6]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[7]  A. Prasad Sistla,et al.  A Multiprocess Network Logic with Temporal and Spatial Modalities , 1983, ICALP.

[8]  A. Prasad Sistla,et al.  Reasoning in a Restricted Temporal Logic , 1993, Inf. Comput..

[9]  A. Belianin,et al.  A Game-Theoretic Approach , 2001 .

[10]  E. Allen Emerson,et al.  A decidable temporal logic to reason about many processes , 1990, PODC '90.

[11]  Martin Leucker,et al.  Ordered Navigation on Multi-attributed Data Words , 2014, CONCUR.

[12]  Edmund M. Clarke,et al.  Reasoning about networks with many identical finite-state processes , 1986, PODC '86.

[13]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[14]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.

[15]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[16]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[17]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[18]  Moshe Y. Vardi,et al.  A Multi-encoding Approach for LTL Symbolic Satisfiability Checking , 2011, FM.

[19]  Stéphane Demri,et al.  LTL with the Freeze Quantifier and Register Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[20]  Benjamin Aminof,et al.  Parameterized Model Checking of Token-Passing Systems , 2013, VMCAI.

[21]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[22]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[23]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[24]  Stéphane Demri,et al.  Reasoning about Data Repetitions with Counter Systems , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[25]  Orna Grumberg,et al.  An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications , 2013, ATVA.