On the satisfiability of indexed linear temporal logics

Chen, Taolue, Song, Fu and Wu, Zhilin (2015) On the satisfiability of indexed linear temporal logics. In: 26th International Conference on Concurrency Theory, CONCUR 2015, 1-4 Sept 2015, Madrid, Spain.

PDF - Final accepted version (with author's formatting)
Download (583kB) | Preview


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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published in: LIPIcs: Leibniz International Proceedings in Informatics - Volume 42 - CONCUR'15
Keywords (uncontrolled): Satisfiability, Indexed linear temporal logic, Parameterised systems
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 17584
Useful Links:
Depositing User: Taolue Chen
Date Deposited: 21 Sep 2015 09:44
Last Modified: 30 May 2019 22:10
URI: https://eprints.mdx.ac.uk/id/eprint/17584

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year