Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation

TitleProbabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
Publication TypeConference Paper
Year of Publication2012
AuthorsD'Argenio, PR, Lee, MD
EditorBirkedal, L
Conference NameFoundations 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
PublisherSpringer
ISBN Number978-3-642-28728-2
AbstractWe 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.
DOI10.1007/978-3-642-28729-9_30
PDF (Full text): 
Powered by Drupal