Efficient on-the-fly algorithm for checking alternating timed simulation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696495 (Why is no real title available?)
- scientific article; zbMATH DE number 2209335 (Why is no real title available?)
- A theory of timed automata
- Alternating-time temporal logic
- Branching time and abstraction in bisimulation semantics
- CONCUR 2005 – Concurrency Theory
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Lectures on Concurrency and Petri Nets
- Model-checking in dense real-time
- On the synthesis of discrete controllers for timed systems
- The element of surprise in timed games.
- Timed Control with Observation Based and Stuttering Invariant Strategies
- Uppaal in a nutshell
Cited in
(8)- On timed alternating simulation for concurrent timed games
- On timed alternating simulation for concurrent timed games
- Robust specification of real time components
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- Modal event-clock specifications for timed component-based design
- Methodologies for specification of real-time systems using timed I/O automata
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Robust synthesis for real-time systems
This page was built for publication: Efficient on-the-fly algorithm for checking alternating timed simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648824)