Model Checking Probabilistic Timed Automata with One or Two Clocks
From MaRDI portal
Publication:3535619
DOI10.2168/LMCS-4(3:12)2008zbMath1147.68574MaRDI QIDQ3535619
Marcin Jurdziński, François Laroussinie, Jeremy Sproston
Publication date: 13 November 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Expected reachability-time games, Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems, Model checking for probabilistic timed automata, Looking at mean-payoff and total-payoff through windows, Concavely-Priced Probabilistic Timed Automata, Strict Divergence for Probabilistic Timed Automata, The Odds of Staying on Budget