A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification

Authors:
Suzana Andova;Jos C. M. Baeten;Tim A. C. Willemse
Affiliations:
Department of Telematics, Norwegian University of Science, Trondheim, Norway;Department of Mathematics and Computer Science, Eindhoven University of Technology, MB Eindhoven, The Netherlands;Faculty of Science, Mathematics and Computing Science, University of Nijmegen, GL Nijmegen, The Netherlands
Venue:
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Year:
2006

Citing 12
Cited 3

On the consistency of Koomen's fair abstraction rule

Theoretical Computer Science
Process algebra

Process algebra
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Process algebra with language matching

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Communication and Concurrency

Communication and Concurrency
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Axiomatizations for Probabilistic Bisimulation

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Abstraction in Probabilistic Process Algebra

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Weak Bisimulation for Probabilistic Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Process Algebra with Probabilistic Choice

ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Branching bisimulation for probabilistic systems: characteristics and decidability

Theoretical Computer Science - Expressiveness in concurrency
Axiomatizations for probabilistic finite-state behaviors

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Remarks on Testing Probabilistic Processes

Electronic Notes in Theoretical Computer Science (ENTCS)
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Timed, distributed, probabilistic, typed processes

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider abstraction in probabilistic process algebra. The process algebra can be employed for specifying processes that exhibit both probabilistic and non-deterministic choices in their behaviour. We give a set of axioms that completely axiomatises the branching bisimulation for the strictly alternating probabilistic graph model. In addition, several recursive verification rules are identified, allowing us to remove redundant internal activity. Using the axioms and the verification rules, we have successfully conducted a verification of the Concurrent Alternating Bit Protocol. This is a simple communication protocol, slightly more ‘sophisticated' than the well-known Alternating Bit Protocol. As channels are lossy, sending continuous streams of data through the channels is a method to overcome this possible loss of data. This instigates a considerable level of parallelism (parallel activities) and as such requires more complex techniques for proving the protocol correct. Using our process algebra we show that after abstraction of internal activity, the protocol behaves as a buffer.