Tableau-based model checking in the propositional mu-calculus (Q1122572)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4106831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tableau-based model checking in the propositional mu-calculus |
scientific article; zbMATH DE number 4106831 |
Statements
Tableau-based model checking in the propositional mu-calculus (English)
0 references
1990
0 references
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.
0 references
automated analysis of concurrent systems
0 references
finite-state systems
0 references
propositional mu-calculus
0 references
tableau-based proof system
0 references
0.8527064323425293
0 references
0.852148175239563
0 references
0.8458642959594727
0 references
