An extension of the inverse method to probabilistic timed automata

DOI10.1007/s10703-012-0169-xzbMath1291.68240OpenAlexW2044499152MaRDI QIDQ2248053

Étienne André, Jeremy Sproston, Laurent Fribourg

Publication date: 30 June 2014

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-012-0169-x

zbMATH Keywords

probabilistic model checkingparametric timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

Tweaking the odds in probabilistic timed automata ⋮ Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions ⋮ Parameter synthesis for probabilistic timed automata using stochastic game abstractions ⋮ Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties ⋮ An extension of the inverse method to probabilistic timed automata ⋮ Model checking for probabilistic timed automata ⋮ Consistency in parametric interval probabilistic timed automata

Uses Software

• IMITATOR
• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Performance analysis of probabilistic timed automata using digital clocks
• Parametric probabilistic transition systems for system design and analysis
• A theory of timed automata
• Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
• Automatic verification of real-time systems with discrete probability distributions.
• Linear parametric model checking of timed automata
• An extension of the inverse method to probabilistic timed automata
• Symbolic model checking for probabilistic timed automata
• Behavioral Cartography of Timed Automata
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Stochastic Games for Verification of Probabilistic Timed Automata
• Parametric real-time reasoning
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: An extension of the inverse method to probabilistic timed automata