Abstract:
This paper describes a procedure, based around the construction of tableau proofs, for determining whether finite-state systems enjoy properties formulated in the propositional mu-calculus. It presents a tableau-based proof system for the logic and proves it sound and complete, and it discusses techniques for the efficient construction of proofs that states enjoy properties expressed in the logic. The approach is the basis of an ongoing implementation of a model checker in the Concurrency Workbench, an automated tool for the analysis of concurrent systems. 1
Citations
|
1472
|
Model Checking
– Clarke, Grumberg, et al.
- 2001
|
|
1081
|
A Calculus of Communicating Systems
– Milner
- 1989
|
|
464
|
An Automata-Theoretic Approach to Automatic Program Verification. LICS
– Vardi, Wolper
- 1986
|
|
404
|
Algebraic laws for nondeterminism and concurrency
– Hennessy, Milner
- 1985
|
|
343
|
A lattice-theoretical fixpoint theorem and its applications
– Tarski
- 1955
|
|
300
|
Results on the propositional -calculus
– Kozen
- 1983
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
250
|
Automatic Verification of Finite State Concurrent System Using Temporal Logic Specification
– Clarke, Emerson, et al.
- 1986
|
|
185
|
Efficient model checking in fragments of the propositional mu-calculus
– Emerson, Lei
- 1986
|
|
145
|
Sometimes” and “not never” revisited: on branching versus linear time temporal logic
– Emerson, Halpern
- 1986
|
|
132
|
S.Sims. The ncsu concurrency workbench
– Cleaveland
|
|
96
|
Local model checking in the modal mu-calculus
– Stirling, Walker
- 1989
|
|
87
|
Characterizing correctness properties of parallel programs Using Fixpoints
– Emerson, Clarke
- 1980
|
|
67
|
Automatic verification of sequential circuits using temporal logic
– Browne, Clarke, et al.
- 1986
|
|
59
|
Modal logics for communicating systems
– Stirling
- 1987
|
|
36
|
Proof System for Hennessy-Milner Logic with Recursion
– Larsen
- 1988
|
|
30
|
A note on model checking the modal -calculus
– Winskel
- 1989
|
|
27
|
A linear algorithm to solve fixed-point equations on transition systems
– Arnold, Crubille
- 1988
|
|
27
|
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
– Pnueli
- 1985
|
|
12
|
Checking the Correctness of Sequential Circuits
– Browne, Clarke, et al.
- 1985
|
|
11
|
Characteristic formulae for CCS with divergence
– Steffen, Ing'olfsd'ottir
- 1994
|
|
10
|
An improved algorithm for the automatic verification of finite state systems using temporal logic
– Browne
- 1986
|
|
10
|
A Complete Modal Proof System for a Subset of SCCS
– Stirling
- 1985
|
|
7
|
Automatic circuit verification using temporal logic: Two new examples
– Browne, Clarke, et al.
- 1986
|
|
4
|
A semantics-based tool for the verification of finite-state systems
– Cleaveland, Parrow, et al.
- 1989
|
|
4
|
Sometimes is sometimes ”not never”–on the temporal logic of programs
– Lamport
- 1980
|
|
3
|
Submodule Construction as Equation Solving in CCS
– Parrow
- 1989
|
|
1
|
Branching Time Temporal Logic: A Tutorial
– Emerson
- 1988
|
|
