Timed Automata Can Always Be Made Implementable

DOI10.1007/978-3-642-23217-6_6MaRDI QIDQ3090823zbMATH OpenOpenAlexFDO

Authors Patricia Bouyer, Nicolas Markey, Ocan Sankur, Claus Thrane, Kim G. 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On implementable timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• scientific article; zbMATH DE number 1507209
• scientific article; zbMATH DE number 2102690
• scientific article; zbMATH DE number 6300098
• Timed automata
• scientific article; zbMATH DE number 2080209
• A theory of timed automata
• scientific article; zbMATH DE number 3480493

Cites work

• A quantitative characterization of weighted Kripke structures in temporal logic
• A theory of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Bisimulation through probabilistic testing
• Dynamical properties of timed automata
• Formal Modeling and Analysis of Timed Systems
• Formal Modeling and Analysis of Timed Systems
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1304998 (Why is no real title available?)
• scientific article; zbMATH DE number 2038772 (Why is no real title available?)
• scientific article; zbMATH DE number 2085321 (Why is no real title available?)
• Probabilistic and Topological Semantics for Timed Automata
• Quantitative analysis of weighted transition systems
• Robust Analysis of Timed Automata Via Channel Machines
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• Robust safety of timed automata
• Sampled semantics of timed automata

Cited in

(11)

• Shrinking timed automata
• Sampled semantics of 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
• On implementable timed automata
• CONCUR 2004 - Concurrency Theory
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Timed Automata Can Always Be Made Implementable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090823)