Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
Model Checking and Artificial Intelligence
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Relaxation Refinement: A New Method to Generate Heuristic Functions
Model Checking and Artificial Intelligence
Transition-Based Directed Model Checking
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
The Causal Graph Revisited for Directed Model Checking
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
UPPAAL/DMC: abstraction-based heuristics for directed model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Fast directed model checking via Russian Doll abstraction
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Context-enhanced directed model checking
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Specifying fault-tolerance using split precondition logic
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Directed model checking with distance-preserving abstractions
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Adapting an AI planning heuristic for directed model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Mcta: heuristics and search for timed systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We apply both model checking and logical reasoning to a real-time protocol for mutual exclusion. To this end we employ PLC-Automata, an abstract notion of programs for real-time systems. A logic-based semantics in terms of Duration Calculus is used to verify the correctness of the protocol by logical reasoning. An alternative but consistent operational semantics in terms of Timed Automata is used to verify the correctness by model checkers. Since model checking of the full model does not terminate in all cases within an acceptable time we examine abstractions and their influence on model-checking performance. We present two abstraction methods that can be applied successfully for the protocol presented.