A linear process algebraic format for probabilistic systems with data (extended version

Abstract—This paper presents a novel linear process alge-braic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar techniques for traditional process algebras with data, and — more importantly — treats data and data-dependent probabilistic choice in a fully symbolic manner, paving the way to the symbolic analysis of parameterised probabilistic systems. Keywords-probabilistic process algebra, linearisation, data-dependent probabilistic choice, symbolic transformations I