Verifying quantitative properties of continuous probabilistic timed automata (2000)

by Marta Kwiatkowska , Gethin Norman , Roberto Segala , Jeremy Sproston
Citations:36 - 10 self

Documents Related by Co-Citation

2014 A theory of timed automata – Rajeev Alur - 1999
124 Approximate symbolic model checking of continuous-time Markov chains (Extended Abstract) – Christel Baier, Joost-pieter Katoen, Holger Hermanns - 1999
207 Model Checking of Probabilistic and Nondeterministic Systems – Andrea Bianco, Luca De Alfaro - 1995
594 Introduction to Numerical Solution of Markov Chains – W J Stewart - 1994
482 Symbolic Model Checking for Real-time Systems – Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - 1992
610 A Compositional Approach to Performance Modelling – Jane Hillston - 1996
1194 Automatic verification of finite-state concurrent systems using temporal logic specifications – E. M. Clarke, E. A. Emerson, A. P. Sistla - 1986
191 PRISM: Probabilistic symbolic model checker – Marta Kwiatkowska, Gethin Norman, David Parker - 2002
504 UPPAAL in a Nutshell – Kim G. Larsen, Paul Pettersson, Wang Yi - 1997