@inbook{7b2dd00a0bb84dd1ac564c763e7a9e25,
title = "A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice",
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 backslashtau -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 = "Alvim, {M{\'a}rio S.} and Kostas Chatzikokolakis and Carlos Olarte and Frank Valencia",
booktitle = "The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy: Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday",
address = "United Kingdom",
}