Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Theoretical Computer Science
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Lectures on Discrete Geometry
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
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Compositional Approach to Performance Modelling (Distinguished Dissertations in Computer Science)
A Compositional Approach to Performance Modelling (Distinguished Dissertations in Computer Science)
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Process Algebraic Approach to Software Architecture Design
A Process Algebraic Approach to Software Architecture Design
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Logical Characterization
Information and Computation
Concurrency meets probability: theory and practice
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Modelling, reduction and analysis of markov automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak bisimulation for such systems and prove that this provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between such systems, a generalisation of reduction barbed congruence, the well-known touchstone equivalence for a large variety of process description languages.