Probabilistic and Topological Semantics for Timed Automata

DOI10.1007/978-3-540-77050-3_15MaRDI QIDQ5458833zbMATH OpenOpenAlexFDO

Authors Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Grösser, 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

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking for probabilistic timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• On probabilistic timed automata.
• Symbolic model checking for probabilistic timed automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks

Cites work

• A classification of symbolic transition systems
• A theory of timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• scientific article; zbMATH DE number 3128731 (Why is no real title available?)
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1461253 (Why is no real title available?)
• scientific article; zbMATH DE number 1444348 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Probabilistic and Topological Semantics for Timed Automata
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• Validation of Stochastic Systems

Cited in

(18)

• When are stochastic transition systems tameable?
• Consistency in parametric interval probabilistic timed automata
• A maximal entropy stochastic process for a timed automaton
• Probabilistic Automata for Safety LTL Specifications
• 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
• Simulation and Bisimulation for Probabilistic Timed Automata
• Trace-Based Semantics for Probabilistic Timed I/O Automata
• A survey of timed automata for the development of real-time systems
• Robust Analysis of Timed Automata Via Channel Machines
• Probabilistic and Topological Semantics for Timed Automata
• Weak bisimulation for probabilistic timed automata
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
• Probabilistic and prioritized models of timed CSP
• Reinforcement planning for effective -optimal policies in dense time with discontinuities

This page was built for publication: Probabilistic and Topological Semantics for Timed Automata

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