The following pages link to POEM (Q16001):
Displaying 7 items.
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Unfoldings: A partial-order approach to model checking. (Q2426635) (← links)
- Using non-convex approximations for efficient analysis of timed automata (Q2911614) (← links)
- Stronger Reduction Criteria for Local First Search (Q3525144) (← links)
- SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (Q3557090) (← links)
