Survey on Directed Model Checking
From MaRDI portal
Publication:3614878
DOI10.1007/978-3-642-00431-5_5zbMath1226.68042OpenAlexW2129659049MaRDI QIDQ3614878
Husain Aljazzar, Anton Wijs, Viktor Schuppan, Stefan Edelkamp, Dragan Bošnački, Ansgar Fehnker
Publication date: 17 March 2009
Published in: Model Checking and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00431-5_5
Related Items (7)
Automata-driven partial order reduction and guided search for LTL model checking ⋮ Wireless protocol validation under uncertainty ⋮ Flash memory efficient LTL model checking ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy ⋮ Directed reachability for infinite-state systems ⋮ Hierarchical Adaptive State Space Caching Based on Level Sampling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
- 25 years of model checking. History, achievements, perspectives
- Combining partial-order reductions with on-the-fly model-checking.
- Depth-first iterative-deepening: An optimal admissible tree search
- Automata-theoretic techniques for modal logics of programs
- A theory of timed automata
- A logic for reasoning about time and reliability
- Algorithms for memory hierarchies. Advanced lectures
- Job shop scheduling with beam search
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Scheduling with timed automata
- Breadth-first heuristic search
- Compositional SCC analysis for language emptiness
- On a routing problem
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking
- Pruning State Spaces with Extended Beam Search
- Extended Directed Search for Probabilistic Timed Reachability
- Semi-external LTL Model Checking
- Heuristic Search for the Analysis of Graph Transition Systems
- Frontier search
- Grammar Analysis and Parsing by Abstract Interpretation
- Generalized best-first search strategies and the optimality of A*
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- AI 2003: Advances in Artificial Intelligence
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Distributed Extended Beam Search for Quantitative Model Checking
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- Tools and Algorithms for the Construction and Analysis of Systems
- Lectures on Concurrency and Petri Nets
- Model-checking continuous-time Markov chains
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
- Counterexamples in Probabilistic Model Checking
- Formal Modeling and Analysis of Timed Systems
- Model Checking Software
- Model Checking Software
- Computer Aided Verification
- Partial-order reduction in symbolic state-space exploration
This page was built for publication: Survey on Directed Model Checking
