A graphical µ-calculus and local model checking

Authors:
Huimin Lin
Affiliations:
Laboratory for Computer Science, Institute of Software, The Chinese Academy of Sciences P.O. Box 8718, Beijing 100080. P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 7
Cited 0

Tableau-based model checking in the propositional mu-calculus

Acta Informatica
Local model checking in the modal mu-calculus

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Model checking and boolean graphs

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Model checking

Model checking
Handbook of Process Algebra

Handbook of Process Algebra
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Local Correctness Checking

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graphical notation for the propositional µ-calculus, called modal graphs, is presented. It is shown that both the textual and equational presentations of the µ-calculus can be translated into modal graphs. A model checking algorithm based on such graphs is proposed. The algorithm is truly local in the sense that it only generates the parts of the underlying search space which are necessary for the computation of the final result. The correctness of the algorithm is proven and its complexity analysed.