We recast Selinger's CPM-construction of completely positive maps [11] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of compl...
The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define ano...
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and...
Traditional methods for combining theory solvers rely on capabilities of the solvers to produce all implied equalities or a pre-processing step that introduces additional literals...