Robustness and implementability of timed automata
From MaRDI portal
Recommendations
Cited in
(18)- Computing maximally-permissive strategies in acyclic timed automata
- Almost ASAP semantics: from timed models to timed implementations
- Shrinking timed automata
- Robust Controller Synthesis in Timed Automata
- Quantitative robustness analysis of flat timed automata
- Timed Automata Can Always Be Made Implementable
- Robust Model-Checking of Linear-Time Properties in Timed Automata
- Distributed Timed Automata with Independently Evolving Clocks
- Robust undecidability of timed and hybrid systems
- Relating syntactic and semantic perturbations of hybrid automata
- Modelling and Verification of Timed Robotic Controllers
- Distributed event clock automata (extended abstract)
- Hybrid Systems: Computation and Control
- Robust Analysis of Timed Automata Via Channel Machines
- Probabilistic and Topological Semantics for Timed Automata
- Systematic implementation of real-time models
- Formal Modeling and Analysis of Timed Systems
- Synthesis of robust optimal real-time systems
This page was built for publication: Robustness and implementability of timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464742)