Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
DOI10.1007/978-3-319-11439-2_14zbMath1393.68095OpenAlexW1655603041MaRDI QIDQ3447704
Marta Kwiatkowska, Aleksandra Ž. Jovanović
Publication date: 28 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11439-2_14
Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Cites Work
- A game-based abstraction-refinement framework for Markov decision processes
- Performance analysis of probabilistic timed automata using digital clocks
- The complexity of stochastic games
- A theory of timed automata
- 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
- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
- Stochastic Games for Verification of Probabilistic Timed Automata
- Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games
- Parametric real-time reasoning
- Integer Parameter Synthesis for Timed Automata
This page was built for publication: Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions