A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification

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.

[1]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[2]  Stephen Gilmore,et al.  Specifying Performance Measures for PEPA , 1999, ARTS.

[3]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[4]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  J. C. Mulder,et al.  A modular approach to protocol verification using process algebra , 1986 .

[7]  J. Baeten.  Applications of process algebra , 1990 .

[8]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[9]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[10]  Jos van Wamel.  Process Algebra with Language Matching , 1997, Theor. Comput. Sci..

[11]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[12]  Jos C. M. Baeten,et al.  Abstraction in Probabilistic Process Algebra , 2001, TACAS.

[13]  Roberto Segala,et al.  Axiomatizations for Probabilistic Bisimulation , 2001, ICALP.

[14]  Suzana Andova,et al.  Branching bisimulation for probabilistic systems: Characteristics and decidability , 2005, Theor. Comput. Sci..

[15]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[16]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[17]  Jos C. M. Baeten,et al.  Alternative composition does not imply non-determinism , 2002, Bull. EATCS.

[18]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

[19]  Bengt Jonsson,et al.  Probabilistic Process Algebra , 2001 .

[20]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[21]  Yuxin Deng,et al.  Axiomatizations for Probabilistic Finite-State Behaviors , 2005, FoSSaCS.

[22]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[23]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.