On probabilistic timed automata.

DOI10.1016/S0304-3975(01)00215-8zbMath1064.68063OpenAlexW2009363597MaRDI 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 processModel-checkingProbabilistic timed automata

Mathematics Subject Classification ID

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

Related Items (10)

Expected reachability-time games ⋮ Symbolic model checking for probabilistic timed automata ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ Strict Divergence for Probabilistic Timed Automata ⋮ Weak bisimulation for probabilistic timed automata ⋮ A survey of timed automata for the development of real-time systems ⋮ Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties ⋮ Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata ⋮ Model checking 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

This page was built for publication: On probabilistic timed automata.