On probabilistic timed automata.

DOI10.1016/S0304-3975(01)00215-8zbMath1064.68063MaRDI QIDQ1853732

Danièle Beauquier

Publication date: 22 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00215-8

zbMATH Keywords

Markov decision process; Model-checking; Probabilistic timed automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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

Related Items

Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties, Expected reachability-time games, A survey of timed automata for the development of real-time systems, Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata, Weak bisimulation for probabilistic timed automata, Model checking for probabilistic timed automata, Symbolic model checking for probabilistic timed automata, Concavely-Priced Probabilistic Timed Automata, Strict Divergence for Probabilistic Timed Automata, Stochastic Games for Verification of Probabilistic Timed Automata

Cites Work

• Unnamed Item
• Rational \(\omega\)-languages are non-ambiguous
• A theory of timed automata
• A logic for reasoning about time and reliability
• Model checking of probabilistic and nondeterministic systems
• On the complexity of finite memory policies for Markov decision processes
• The Complexity of Markov Decision Processes
• The complexity of probabilistic verification
• Markov decision processes and regular events
• Testing and generating infinite sequences by a finite automaton