Timed Automata Can Always Be Made Implementable
From MaRDI portal
Publication:3090823
DOI10.1007/978-3-642-23217-6_6zbMath1343.68134OpenAlexW2196692106MaRDI QIDQ3090823
Patricia Bouyer, Claus Thrane, Ocan Sankur, Nicolas Markey, Kim Guldstrand Larsen
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_6
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
On Implementable Timed Automata ⋮ Shrinking timed automata ⋮ Robust synthesis for real-time systems ⋮ A survey of timed automata for the development of real-time systems ⋮ General quantitative specification theories with modal transition systems ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Parameter synthesis for hierarchical concurrent real-time systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative analysis of weighted transition systems
- Robust safety of timed automata
- Bisimulation through probabilistic testing
- A theory of timed automata
- Dynamical properties of timed automata
- Almost ASAP semantics: from timed models to timed implementations
- Sampled Semantics of Timed Automata
- Robust Model-Checking of Linear-Time Properties in Timed Automata
- Robust Analysis of Timed Automata Via Channel Machines
- Probabilistic and Topological Semantics for Timed Automata
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Formal Modeling and Analysis of Timed Systems
- Formal Modeling and Analysis of Timed Systems
This page was built for publication: Timed Automata Can Always Be Made Implementable