Bisimulations meet PCTL equivalences for probabilistic automata

Authors:
Lei Song;Lijun Zhang;Jens Chr. Godskesen
Affiliations:
IT University of Copenhagen, Denmark;DTU Informatics, Technical University of Denmark;IT University of Copenhagen, Denmark
Venue:
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Year:
2011

Citing 18
Cited 2

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Bisimulation through probabilistic testing

Information and Computation
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Deciding bisimilarity and similarity for probabilistic processes

Journal of Computer and System Sciences
Communication and Concurrency

Communication and Concurrency
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Weak Bisimulation for Probabilistic Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Game Relations and Metrics

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
Comparative branching-time semantics for Markov chains

Information and Computation
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
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis

IEEE Transactions on Dependable and Secure Computing
Probabilistic Logical Characterization

Information and Computation
Bisimulations meet PCTL equivalences for probabilistic automata

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory

Bisimulations meet PCTL equivalences for probabilistic automata

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic automata (PA) [20] have been successfully applied in the formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on PCTL [11] and its extension PCTL* [4]. Various behavioral equivalences are proposed for PAs, as a powerful tool for abstraction and compositional minimization for PAs. Unfortunately, the behavioral equivalences are well-known to be strictly stronger than the logical equivalences induced by PCTL or PCTL*. This paper introduces novel notions of strong bisimulation relations, which characterizes PCTL and PCTL* exactly. We also extend weak bisimulations characterizing PCTL and PCTL* without next operator, respectively. Thus, our paper bridges the gap between logical and behavioral equivalences in this setting.