Local Model Checking in Park's -calculus
نویسنده
چکیده
Temporal logic model checking is a veriication method for reactive systems. In global model checking , the truth of a formula (and its subformulae) is determined for all the states in the model. Local model checking procedures are designed for proving that a speciic state of the model satisses a given formula. This may avoid the exhaustive traversal of a model and can thus be applied also to innnite models. Also, the proof tree constructed during local model checking can serve as a witness (counterexample) which demonstrates the error in the design and can thus help locating errors. In this paper, we introduce a tableau system and thus a local model checking method for the-calculus of Park 1] and prove its soundness and completeness.
منابع مشابه
Eecient Local Model-checking for Fragments of the Modal -calculus
This paper develops eecient local model-checking algorithms for expressive fragments of the modal-calculus. The time complexity of our procedures matches that of the best existing global algorithms; however, in contrast to those routines, ours explore a system's state space in a need-driven fashion and do not require its a priori construction. Consequently, our algorithms should perform better ...
متن کاملEfficient Graph-based Algorithms for Model Checking in the Modal Mu-calculus Abstract of the Dissertation Eecient Graph-based Algorithms for Model Checking in the Modal Mu-calculus
of the Dissertation E cient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus by Oleg Sokolsky Doctor of Philosophy in Computer Science State University of New York at Stony Brook 1996 Various model-checking algorithms for the alternation-free subset of the modal mu-calculus are considered. The algorithms are based on a data structure called the product graph, which represents ...
متن کاملModal #-Calculus, Model Checking and Gaufl Elimination
In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gaufl elimination for linear equation systems. It does not require backtracking techniques. Within one framework we suggest a global and a local algorithm. In the context...
متن کاملLocal Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus
Programs written in value-passing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we deene a value-based alternation-free modal-calculus built from typed variables, pattern-matching modalities, and parameterised xed point operators. The ver...
متن کاملProving∀μ -Calculus Properties with SAT-Based Model Checking
In this paper, we present a complete bounded model checking algorithm for the universal fragment of μ-calculus. The new algorithm checks the completeness of bounded proof of each property on the fly and does not depend on prior knowledge of the completeness thresholds. The key is to combine both local and bounded model checking techniques and use SAT solvers to perform local model checking on f...
متن کامل