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 alt...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Andova, Suzana, Baeten, Jos C. M., Willemse, Tim A. C.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Complete Axiomatisation Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Nondeterministic Choice Probabilistic Choice Probabilistic System Process Algebra Software
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!