Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 40-58
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- Bisimulation Metrics for Continuous Markov Decision ProcessesSIAM Journal on Computing, 2011
- Probabilistic reachability and safety for controlled discrete time stochastic hybrid systemsAutomatica, 2008
- On finite-state approximants for probabilistic computation tree logicTheoretical Computer Science, 2005
- Labelled Markov Processes: Stronger and Faster ApproximationsElectronic Notes in Theoretical Computer Science, 2004
- Metrics for labelled Markov processesTheoretical Computer Science, 2004
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processesThe Journal of Logic and Algebraic Programming, 2003
- Bisimulation for Labelled Markov ProcessesInformation and Computation, 2002
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Bisimulation through probabilistic testingInformation and Computation, 1991
- Electric load model synthesis by diffusion approximation of a high-order hybrid-state stochastic systemIEEE Transactions on Automatic Control, 1985