Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
The UniForM Workbench, a Universal Development Environment for Formal Methods
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Comparing model checking and logical reasoning for real-time systems
Formal Aspects of Computing
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
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
Structure and complexity in planning with unary operators
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
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
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
Context-enhanced directed model checking
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Abstractions and pattern databases: the quest for succinctness and accuracy
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
A box-based distance between regions for guiding the reachability analysis of spaceex
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state space traversal is guided through a function that estimates the distance to nearest error states. States with lower estimates are preferably expanded during the search. Obviously, the challenge is to develop distance functions that are efficiently computable on the one hand and as informative as possible on the other hand. In this paper, we introduce the causal graph structure to the context of directed model checking. Based on causal graph analysis, we first adapt a distance estimation function from AI planning to directed model checking. Furthermore, we investigate an abstraction that is guaranteed to preserve error states. The experimental evaluation shows the practical potential of these techniques.