Linear temporal logic (LTL) is commonly used in model checking tasks; moreover, it is well-
suited for the formalization of technical requirements. However, the correct specification and …

Formal methods for the specification and verification of hardware and software systems are
becoming more and more important as systems increase in size and complexity. The aim of …

Translating linear temporal logic formulas to automata has proven to be an effective
approach for implementing linear-time model-checking, and for obtaining many extensions …

This article addresses the problem of designing memory-efficient algorithms for the
verification of temporal properties of finite-state programs. Both the programs and their …

This paper presents a model-checking method for linear-time temporal logic that can avoid
most of the state explosion due to the modeling of concurrency by interleaving. The method …

This paper presents an algorithm for detecting deadlocks in concurrent finite-state systems
without incurring most of the state explosion due to the modeling of concurrency by …

There is a growing recognition of the need to apply formal mathematical methods in the
design of\high con dence" computing systems. Such systems operate in safety critical …

Partial-order verification methods exploit “independency” between transitions of a
concurrent program to avoid parts of the state space explosion due to the modeling of …

We are given a transition system implicitly through a compact representation and wish to
perform simultaneously reachability analysis and minimization without constructing first the …

This paper gives an on-the-fly algorithm for determining whether a finite-state system
satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches …