Simple On-the-fly Automatic Verification of Linear Temporal Logic

Gerth, Rob; Peled, Doron; Vardi, Moshe Y.; Wolper, Pierre

doi:10.1007/978-0-387-34892-6_1

Cited by 472 publications

(491 citation statements)

References 7 publications

Supporting

Mentioning

488

Contrasting

Unclassified

Order By: Relevance

“…A construction of an automaton for an LTL formula was first proposed by Wolper, Vardi, and Sistla [24]. This basic construction has been improved in several papers ( [12,21,9]) where various heuristics have been used to produce automaton as small and as "weak" as possible. Although these heuristics are quite sophisticated, they do not provide any insight into the relation between the formula and the "weakness" of the resulting automaton.…”

Section: Theorem 4 a Property T Specifiable By Automata Is A Guarantmentioning

confidence: 99%

Relating Hierarchy of Temporal Properties to Model Checking

Černá

Pelánek

2003

Mathematical Foundations of Computer Science 2003

View full text Add to dashboard Cite

Section: Theorem 4 a Property T Specifiable By Automata Is A Guarantmentioning

confidence: 99%

Relating Hierarchy of Temporal Properties to Model Checking

Černá

Pelánek

2003

Mathematical Foundations of Computer Science 2003

View full text Add to dashboard Cite

“…Erigone is a single program consisting of several subsystems: (1) a top-down compiler that translates Promela into transitions with a JVM-like byte code for the statements and expressions; (2) a model checker that implements the algorithms as described in [7], except that an explicit stack for pending transitions from the states is used instead of recursion; (3) a translator of LTL to BA using the algorithm in [8].…”

Section: The Implementation Of Erigonementioning

confidence: 99%

Tool Presentation: Teaching Concurrency and Model Checking

Ben‐Ari

2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. This paper describes a set of software tools developed for teaching concurrency and model checking. jSpin is an elementary development environment for Spin that formats and filters the output of a simulation according to the user's specification. SpinSpider uses debugging output from Spin to generate a diagram of the state space of a Promela model; the diagram can be incrementally displayed using iDot. VN supports teaching nondeterministic finite automata. The Erigone model checker is a partial reimplementation of Spin designed to be easy to use, well structured and well documented. It produces a full trace of the execution of the model checker in a format that is both readable and amenable to postprocessing.

show abstract

“…In searching for a counter example, a negative occurrence of some [q] Note that this optimization relies on a construction that does not force every state of the property automaton A ¬ϕ to have each snapshot formula either negated or non-negated (i.e., a construction in the style of [3] rather than as in [11] needs to be used). This trick allows to enumerate the satisfying truth assignments of the different such positive subformulas separately.…”

Section: Optimization For Negative Snapshotsmentioning

confidence: 99%

Efficient Model Checking for LTL with Partial Order Snapshots

Niebert

Peled

2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Certain behavioral properties of distributed systems are difficult to express in interleaving semantics, whereas they are naturally expressed in terms of partial orders of events or, equivalently, Mazurkiewicz traces. Examples of such properties are serializability of a database or snapshots. Recently, a modest extension for LTL by an operator that expresses snapshots has been proposed. It combines the ease of linear (interleaving) specification with this useful partial order concept. The new construct allows one to assert that a global snapshot (also called a slice or a cut) was passed, perhaps not in the observed (interleaved) execution sequence, but possibly in a (trace) equivalent one. A model checking algorithm was suggested for a subset of this logic, with PSPACE complexity in the size of the system and the checked formula. For the whole logic, a solution that is in EXSPACE in the size of the system (PSPACE in the number of its global states) was given.In this paper, we provide a model checking algorithm in PSPACE in the size of a system of communicating sequential processes when restricting snapshots to boolean combinations of local properties of each process. Concerning size of the formula, it is PSPACE for the case of snapshot properties expressed in DNF, and EXPSPACE where a translation to DNF is necessary.

show abstract

Simple On-the-fly Automatic Verification of Linear Temporal Logic

Cited by 472 publications

References 7 publications

Relating Hierarchy of Temporal Properties to Model Checking

Relating Hierarchy of Temporal Properties to Model Checking

Tool Presentation: Teaching Concurrency and Model Checking

Efficient Model Checking for LTL with Partial Order Snapshots

Contact Info

Product

Resources

About