Probabilistic and Topological Semantics for Timed Automata

DOI10.1007/978-3-540-77050-3_15zbMATH Open1135.68464OpenAlexW1496392897MaRDI QIDQ5458833FDOQ5458833

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

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

Mathematics Subject Classification ID

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

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• Probabilistic and Topological Semantics for Timed Automata
• Hybrid Systems: Computation and Control
• A classification of symbolic transition systems
• Validation of Stochastic Systems
• Hybrid Systems: Computation and Control
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

Cited In (17)

• A survey of timed automata for the development of real-time systems
• Model-based verification, optimization, synthesis and performance evaluation of real-time systems
• Probabilistic and prioritized models of timed CSP
• Probabilistic and Topological Semantics for Timed Automata
• Simulation and Bisimulation for Probabilistic Timed Automata
• A maximal entropy stochastic process for a timed automaton
• Probabilistic Automata for Safety LTL Specifications
• Consistency in parametric interval probabilistic timed automata
• Weak bisimulation for probabilistic timed automata
• When are stochastic transition systems tameable?
• Timed Automata Can Always Be Made Implementable
• Statistical Model Checking for Networks of Priced Timed Automata
• Baire category quantifier in monadic second order logic
• Trace-Based Semantics for Probabilistic Timed I/O Automata
• Robust Analysis of Timed Automata Via Channel Machines
• Timed symbolic dynamics
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

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)