Distributing timed model checking -- how the search order matters
From MaRDI portal
Recommendations
- Dealing with practical limitations of distributed timed model checking for timed automata
- Distributed Extended Beam Search for Quantitative Model Checking
- Multi-core Reachability for Timed Automata
- On-the-fly workload prediction and redistribution in the distributed timed model checker Zeus
- On memory-block traversal problems in model-checking timed systems
Cited in
(17)- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Dealing with practical limitations of distributed timed model checking for timed automata
- CTL model checking on a shared-memory architecture
- On memory-block traversal problems in model-checking timed systems
- \textsc{Zeus}: a distributed timed model-checker based on \textsc{Kronos}
- Random walk based heuristic algorithms for distributed memory model checking
- Distributed branching bisimulation reduction of state spaces
- On-the-fly workload prediction and redistribution in the distributed timed model checker Zeus
- How to order vertices for distributed LTL model-checking based on accepting predecessors
- Distributed verification of multi-threaded C++ programs
- Measuring and evaluating parallel state-space exploration algorithms
- Improving search order for reachability testing in timed automata
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND
- Model checking of biological systems
- Distributed Extended Beam Search for Quantitative Model Checking
- How to stop time stopping
This page was built for publication: Distributing timed model checking -- how the search order matters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754085)
