An algorithmic approach for checking closure properties of temporal logic specifications and Ω-regular languages
Doron Peled,Thomas Wilke,Pierre Wolper +2 more
- Vol. 195, Iss: 2, pp 183-203
TLDR
This paper develops algorithms for deciding if a property cannot distinguish between equivalent sequences, i.e., is closed under the equivalence relation, and shows that for such properties there is a wide class of equivalence relations for which determining closure is decidable, in fact is in PSPACE.Abstract:
In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not significantly different. One such example is sequences that differ from each other by stuttering, i.e., the number of times a state can adjacently repeat. Another example is executions that differ only by the ordering of independently executed events. Considering these sequences as different is semantically rather meaningless. Nevertheless, specification languages that are based on interleaving semantics, such as linear temporal logic (LTL), can distinguish between them. This situation has led to several attempts to define languages that cannot distinguish between such equivalent sequences. In this paper, we take a different approach to this problem: we develop algorithms for deciding if a property cannot distinguish between equivalent sequences, i.e., is closed under the equivalence relation. We focus on properties represented by regular languages, ω-regular languages, or prepositional LTL formulas and show that for such properties there is a wide class of equivalence relations for which determining closure is decidable, in fact is in PSPACE. Hence, checking the closure of a specification is no more difficult than checking satisfiability of a temporal formula. Among the closure properties we are able to handle, one finds trace closedness, stutter closedness and projective closedness, for all of which we are also able to prove a PSPACE lower bound. Being able to check that a property is closed under an equivalence relation has an immediate application in state-space exploration based verification. Indeed, the knowledge that the specification does not distinguish between equivalent execution sequences allows constructing a reduced state space where it is sufficient that at least one sequence per equivalence class is represented.read more
Citations
More filters
Journal ArticleDOI
Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints
TL;DR: A method for automatic planning of optimal paths for a group of robots that satisfy a common high-level mission specification and leverages the communication capabilities of the robots to guarantee correctness during deployment and provide bounds on the deviation from the optimal values.
Proceedings ArticleDOI
Events and constraints: a graphical editor for capturing logic requirements of programs
TL;DR: The TimeLine Editor simplified the task of converting a large body of English prose requirements into formal, yet readable, logic requirements, and was used to verify the call processing code for Lucent's PathStar access server against the TelCordia LSSGR standards.
Proceedings ArticleDOI
Robust multi-robot optimal path planning with temporal logic constraints
TL;DR: A method for automatically planning robust optimal paths for a group of robots that satisfy a common high level mission specification and characterize a class of LTL formulas that are robust to robot timing errors.
Book ChapterDOI
Synthesis of Distributed Algorithms Using Asynchronous Automata
TL;DR: This work uses safe asynchronous automata as implementation model, and characterise the languages they accept, and develops and implements a synthesis algorithm for the classic problem of mutual exclusion.
Proceedings ArticleDOI
Synthesis of distributed control and communication schemes from global LTL specifications
TL;DR: A technique for synthesis of control and communication strategies for a team of agents from a global task specification given as a Linear Temporal Logic formula over a set of properties that can be satisfied by the agents is introduced.
References
More filters
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Book
Handbook of theoretical computer science
TL;DR: The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field.
Journal ArticleDOI
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
TL;DR: Many large sequential computers execute operations in a different order than is specified by the program, and a correct execution by each processor does not guarantee the correct execution of the entire program.
Book ChapterDOI
Automata on infinite objects
TL;DR: This chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree.
Journal ArticleDOI
The complexity of propositional linear temporal logics
A. P. Sistla,Edmund M. Clarke +1 more
TL;DR: The complexity of satisfiability and determination of truth in a particular finite structure are considered for different propositional linear temporal logics and it is shown that these problems are NP-complete for the logic with F and PSPACE- complete for the logics with F, X, with U, with S, X operators.