Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
| Title | Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation |
| Publication Type | Conference Paper |
| Year of Publication | 2012 |
| Authors | D'Argenio, PR, Lee, MD |
| Editor | Birkedal, L |
| Conference Name | Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings |
| Publisher | Springer |
| ISBN Number | 978-3-642-28728-2 |
| Abstract | We present a format for the specification of probabilistic transition systems that guarantees that bisimulation equivalence is a congruence for any operator defined in this format. In this sense, the format is somehow comparable to the ntyft/ntyxt format in a non-probabilistic setting. We also study the modular construction of probabilistic transition systems specifications and prove that some standard conservative extension theorems also hold in our setting. Finally, we show that the trace congruence for image-finite processes induced by our format is precisely bisimulation on probabilistic systems. |
| DOI | 10.1007/978-3-642-28729-9_30 |
PDF (Full text):
