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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
D’Argenio, P. R., & Lee, M. D. (2012). Probabilistic transition system specification: Congruence and full abstraction of bisimulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7213 LNCS, pp. 452–466). https://doi.org/10.1007/978-3-642-28729-9_30
Mendeley helps you to discover research relevant for your work.