@inbook{7a9726a4b6e040d188f70e0e7541fbd4,
title = "A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract).",
abstract = "This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a basic, recursion-free process language with non-deterministic as well as probabilistic choice. The proof of completeness of the axiomatization builds on the completeness of strong probabilistic bisimilarity on the one hand and on the notion of a concrete process, i.e. a process that does not display (partially) inert τ -moves, on the other hand. The approach is first presented for the non-deterministic fragment of the calculus and next generalized to incorporate probabilistic choice, too.",
author = "{van Glabbeek}, {Rob J.} and Groote, {Jan Friso} and {de Vink}, {Erik P.}",
year = "2019",
month = nov,
day = "4",
doi = "10.1007/978-3-030-31175-9_9",
language = "English",
isbn = "978-3-030-31174-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "139--162",
editor = "M.S. Alvim and K. Chatzikokolakis and C. Olarte and F. Valencia",
booktitle = "The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy",
address = "Germany",
}