Paper Info
Title
Faster Model Checking for the Modal Mu-Calculus
Abstract
In this paper, we develop an algorithm for model checking that handles the full modal mucalculus including alternating fixpoints. Our algorithm has a better worst-case complexity than the best known algorithm for this logic while performing just as well on certain sublogics as other specialized algorithms. Important for the efficiency is an alternative characterisation of formulas in terms of equational systems, which enables the sharing and reuse of intermediate results.
Year
DOI
Venue
1992
10.1007/3-540-56496-9_32
CAV
Keywords
Field
DocType
modal mu-calculus,faster model checking,model checking
Model checking,Computer science,Reuse,Theoretical computer science,Modal
Conference
ISBN
Citations 
PageRank 
3-540-56496-9
59
8.95
References 
Authors
15
3
Name
Order
Citations
PageRank
Rance Cleaveland12266254.39
Marion Klein213623.65
Bernhard Steffen34239423.70