Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules
Probabilistic transition system specifications (PTSS) provide structural operational semantics for reactive probabilistic labeled transition systems. Bisimulation equivalences and bisimulation metrics are fundamental notions to describe behavioral relations and distances of states, respectively. We provide a method to generate from a PTSS a sound and ground-complete equational axiomatization for strong and convex bisimilarity. The construction is based on the method of Aceto, Bloom and Vaandrager developed for non-deterministic transition system specifications. The novelty in our approach is to employ many-sorted algebras to axiomatize separately non-deterministic choice, probabilistic choice and their interaction. Furthermore, we generalize this method to axiomatize the strong and convex metric bisimulation distance of PTSS.
| Main Authors: | , , |
|---|---|
| Format: | article biblioteca |
| Language: | eng |
| Published: |
2014
|
| Subjects: | Axiomatization, Bisimulation, Probability, Structured Operational Semantics, Probabilistic Transition Systems, |
| Online Access: | http://hdl.handle.net/11086/30135 http://dx.doi.org/10.1007/978-3-642-54830-7_19 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|