Probabilistic and Topological Semantics for Timed Automata

DOI10.1007/978-3-540-77050-3_15zbMath1135.68464MaRDI QIDQ5458833

Thomas Brihaye, Patricia Bouyer, Nathalie Bertrand, Marcus Größer, Christel Baier

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_15

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Robust Analysis of Timed Automata Via Channel Machines, Probabilistic and Topological Semantics for Timed Automata, A survey of timed automata for the development of real-time systems, When are stochastic transition systems tameable?, A maximal entropy stochastic process for a timed automaton, Timed Symbolic Dynamics, Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems, Timed Automata Can Always Be Made Implementable, Statistical Model Checking for Networks of Priced Timed Automata, Baire Category Quantifier in Monadic Second Order Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• A classification of symbolic transition systems
• Hybrid Systems: Computation and Control
• Validation of Stochastic Systems
• Probabilistic and Topological Semantics for Timed Automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Hybrid Systems: Computation and Control