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.
KeywordsProbabilistic System Probabilistic Choice Process Algebra Complete Axiomatisation Nondeterministic Choice
Unable to display preview. Download preview PDF.
- 1.Andova, S., Baeten, J.C.M., Willemse, T.A.C.: Complete axiomatisation of probabilistic branching bisimulation, CSR (to appear, 2006), preliminary version available at, http://www.cs.ru.nl/timw/completeness.pdf
- 2.Andova, S., Willemse, T.A.C.: Branching bisimulation for probabilistic systems: characteristics and decidability. In: Baeten, J.C.M., Corradini, F. (eds.) Theor. Comp. Sci., vol. 356(3), pp. 325–355 (2006); Also appeared as a CSR, University of Twente, TR-CTIT-05-08, 2005Google Scholar
- 4.Andova, S., Baeten, J.C.M.: Alternative composition does not imply non-determinism. Bulletin of the European Association for Theoretical Computer Science 76, 125–127 (2002)Google Scholar
- 5.Andova, S.: Probabilistic process algebra, Ph.D. thesis, Eindhoven University of Technology (2002)Google Scholar
- 8.Baeten, J.C.M., Weijland, W.P.: Process algebra. Cambridge University Press, Cambrodge (1990)Google Scholar
- 9.Baier, C.: On algorithmic verification methods for probabilistic systems, Habilitation thesis, University of Mannheim (1998)Google Scholar
- 13.Hansson, H.: Time and probability in formal design of distributed systems, Ph.D. thesis, DoCS 91/27, University of Uppsala (1991)Google Scholar
- 18.Stoelinga, M.: Alea jacta est: Verification of probabilistic, real-time and parametric systems, Ph.D. thesis, Katholieke Universiteit Nijmegen, The Netherlands (2002)Google Scholar