Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bisimulation through probabilistic testing
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Optimal state-space lumping in Markov chains
Information Processing Letters
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Verifying temporal properties of finite-state probabilistic programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Linear and Branching System Metrics
IEEE Transactions on Software Engineering
PRISM: probabilistic model checking for performance and reliability analysis
ACM SIGMETRICS Performance Evaluation Review
The Ins and Outs of the Probabilistic Model Checker MRMC
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Correctness issues of symbolic bisimulation computation for markov chains
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Polynomial-Time verification of PCTL properties of MDPs with convex uncertainties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
This paper deals with the notion of approximate probabilistic bisimulation (APB) relation for discrete-time labeled Markov Chains (LMC). In order to provide a quantified upper bound on a metric over probabilistic realizations for LMC, we exploit the structure and properties of the APB and leverage the mathematical framework of Markov set-Chains. Based on this bound, the article proves that the existence of an APB implies the preservation of robust PCTL formulae, which are formulae that allow being properly relaxed or strengthened, according to the underlying APB. This leads to a notion of robustness for probabilistic model checking.