Cited in
(10)- Using non-convex approximations for efficient analysis of timed automata
- Exploiting step semantics for efficient bounded model checking of asynchronous systems
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Punf
- Checkfence
- Stronger Reduction Criteria for Local First Search
- REDLIB
- A Nice labelling for tree-like event structures of degree 3
- SAT based bounded model checking with partial order semantics for timed automata
- Unfoldings: A partial-order approach to model checking.
This page was built for software: POEM
