Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
State Focusing: Lazy Abstraction for the Mu-Calculus
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
3-Valued abstraction: More precision at less cost
Information and Computation
Mixed Transition Systems Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
Electronic Notes in Theoretical Computer Science (ENTCS)
More precise partition abstractions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Local abstraction-refinement for the mu-calculus
Proceedings of the 14th international SPIN conference on Model checking software
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Solving games via three-valued abstraction refinement
Information and Computation
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Underapproximating predicate transformers
SAS'06 Proceedings of the 13th international conference on Static Analysis
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Compositional verification and 3-valued abstractions join forces
SAS'07 Proceedings of the 14th international conference on Static Analysis
Solving games via three-valued abstraction refinement
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper investigates both the precision and the model checking efficiency of abstract models designed to preserve branching time logics w.r.t. a 3-valued semantics. Current abstract models use ordinary transitions to over approximate the concrete transitions, while they use hyper transitions to under approximate the concrete transitions. In this work we refer to precision measured w.r.t. the choice of abstract states, independently of the formalism used to describe abstract models. We show that current abstract models do not allow maximal precision. We suggest a new class of models and a construction of an abstract model which is most precise w.r.t. any choice of abstract states. As before, the construction of such models might involve an exponential blowup, which is inherent by the use of hyper transitions. We therefore suggest an efficient algorithm in which the abstract model is constructed during model checking, by need. Our algorithm achieves maximal precision w.r.t. the given property while remaining quadratic in the number of abstract states. To complete the picture, we incorporate it into an abstraction-refinement framework.