Deciding bisimilarities on distributions

Authors:
Christian Eisentraut;Holger Hermanns;Julia Krämer;Andrea Turrini;Lijun Zhang
Affiliations:
Computer Science, Saarland University, Saarbrücken, Germany;Computer Science, Saarland University, Saarbrücken, Germany;Computer Science, Saarland University, Saarbrücken, Germany;Computer Science, Saarland University, Saarbrücken, Germany;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China,DTU Informatics, Technical University of Denmark, Denmark,Computer Science, Saarland Un ...
Venue:
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Year:
2013

Citing 17
Cited 0

Bisimulation through probabilistic testing (preliminary report)

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
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
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
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
Lokal Model Checking Games

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Observing Branching Structure through Probabilistic Contexts

SIAM Journal on Computing
Interactive Markov chains: and the quest for quantified quality

Interactive Markov chains: and the quest for quantified quality
Concurrency and composition in a stochastic world

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On Probabilistic Automata in Continuous Time

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
On the semantics of Markov automata

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Probability and nondeterminism in operational models of concurrency

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Exploring probabilistic bisimulations, part I

Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
On the semantics of Markov automata

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic automata (PA) are a prominent compositional concurrency model. As a way to justify property-preserving abstractions, in the last years, bisimulation relations over probability distributions have been proposed both in the strong and the weak setting. Different to the usual bisimulation relations, which are defined over states, an algorithmic treatment of these relations is inherently hard, as their carrier set is uncountable, even for finite PAs. The coarsest of these relation, weak distribution bisimulation, stands out from the others in that no equivalent state-based characterisation is known so far. This paper presents an equivalent state-based reformulation for weak distribution bisimulation, rendering it amenable for algorithmic treatment. Then, decision procedures for the probability distribution-based bisimulation relations are presented.