Pages that link to "Item:Q2576589"
From MaRDI portal
The following pages link to Almost ASAP semantics: from timed models to timed implementations (Q2576589):
Displaying 20 items.
- Robust synthesis for real-time systems (Q386617) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Robust safety of timed automata (Q1028728) (← links)
- Input urgent semantics for asynchronous timed session types (Q2329441) (← links)
- Entropy of regular timed languages (Q2343131) (← links)
- Shrinking timed automata (Q2637311) (← links)
- Predictable real-time software synthesis (Q2642542) (← links)
- Rigorous implementation of real-time systems -- from theory to application (Q2843865) (← links)
- Timed Automata Can Always Be Made Implementable (Q3090823) (← links)
- Robust Model-Checking of Timed Automata via Pumping in Channel Machines (Q3172846) (← links)
- Thin and Thick Timed Regular Languages (Q3172847) (← links)
- Robust Specification of Real Time Components (Q3172848) (← links)
- Crossing the Bridge between Similar Games (Q3172850) (← links)
- Rigorous Discretization of Hybrid Systems Using Process Calculi (Q3172859) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- On Implementable Timed Automata (Q5041274) (← links)
- Hybrid Systems: Computation and Control (Q5307930) (← links)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems (Q5464742) (← links)
- FM 2005: Formal Methods (Q5716871) (← links)
