Expressiveness and conciseness of timed automata for the verification of stochastic models

DOI10.1007/978-3-030-40608-0_11MaRDI QIDQ782571zbMATH OpenOpenAlexFDO

Authors S. Donatelli, Serge Haddad

Publication date 27 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-40608-0_11

Mathematics Subject Classification ID

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

Recommendations

• Model checking for probabilistic timed automata
• Symbolic model checking for probabilistic timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• scientific article; zbMATH DE number 1759607
• Validation of Stochastic Systems
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
• Verified model checking of timed automata
• scientific article; zbMATH DE number 1569133
• Stochastic games for verification of probabilistic timed automata

Cited in

(4)

• Guarded autonomous transitions increase conciseness and expressiveness of timed automata
• Measuring performance of continuous-time stochastic processes using timed automata
• A Maximal Entropy Stochastic Process for a Timed Automaton,
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

This page was built for publication: Expressiveness and conciseness of timed automata for the verification of stochastic models

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