Robust synthesis for real-time systems
From MaRDI portal
Recommendations
Cites work
- A theory of timed automata
- Almost ASAP semantics: from timed models to timed implementations
- CONCUR 2005 – Concurrency Theory
- Efficient on-the-fly algorithm for checking alternating timed simulation
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 2017345 (Why is no real title available?)
- scientific article; zbMATH DE number 1746449 (Why is no real title available?)
- Linear parametric model checking of timed automata
- On the synthesis of discrete controllers for timed systems
- Parametric real-time reasoning
- Quantitative robustness analysis of flat timed automata
- Robust model-checking of timed automata via pumping in channel machines
- Robust safety of timed automata
- Robust specification of real time components
- Shrinking timed automata
- Statistical Model Checking for Networks of Priced Timed Automata
- Symbolic model checking for real-time systems
- Timed Automata Can Always Be Made Implementable
- Timed I/O automata: a complete specification theory for real-time systems
- Timed Parity Games: Complexity and Robustness
Cited in
(9)- Compositionality for quantitative specifications
- Synthesizing robust systems
- Predictable real-time software synthesis
- Robust specification of real time components
- Parameter synthesis for hierarchical concurrent real-time systems
- scientific article; zbMATH DE number 1418467 (Why is no real title available?)
- Progress-preserving refinements of CTA
- Specification Theories for Probabilistic and Real-Time Systems
- Specifiable robustness in reactive synthesis
This page was built for publication: Robust synthesis for real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386617)