The following pages link to (Q5875377):
Displaying 10 items.
- Spotlight abstraction in model checking real-time task schedulability (Q832017) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Incremental Language Inclusion Checking for Networks of Timed Automata (Q2842668) (← links)
- Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata (Q4603564) (← links)
- (Q5089309) (← links)
- On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems (Q5739458) (← links)
- Avoiding shared clocks in networks of timed automata (Q5891347) (← links)
- A local-time semantics for negotiations (Q6536431) (← links)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods (Q6649454) (← links)
