Related papers: Coalgebraic Trace Semantics for Continuous Probabi…
The combination of nondeterminism and probability in concurrent systems lead to the development of several interpretations of process behavior. If we restrict our attention to linear properties only, we can identify three main approaches to…
This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite…
From the Bayesian perspective, the category of conditional probabilities (a variant of the Kleisli category of the Giry monad, whose objects are measurable spaces and arrows are Markov kernels) gives a nice framework for conceptualization…
The recently introduced notions of guarded traced (monoidal) category and guarded (pre-)iterative monad aim at unifying different instances of partial iteration whilst keeping in touch with the established theory of total iteration and…
The classical Szeg\H{o}-Verblunsky theorem relates integrability of the logarithm of the absolutely continuous part of a probability measure on the circle to square summability of the sequence of recurrence coefficients for the orthogonal…
We give a conceptual treatment of the notion of joints, marginals, and independence in the setting of categorical probability. This is achieved by endowing the usual probability monads (like the Giry monad) with a monoidal and an opmonoidal…
This paper is a modified chapter of the author's Ph.D. thesis. We introduce the notions of sequentially approximated types and sequentially approximated Keisler measures. As the names imply, these are types which can be approximated by a…
This article represents a major step in the unification of the theory of algebraic, topological and singular transition matrices by introducing a definition which is a generalization that encompasses all of the previous three. When this…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
Probabilistic databases (PDBs) are used to model uncertainty in data in a quantitative way. In the standard formal framework, PDBs are finite probability spaces over relational database instances. It has been argued convincingly that this…
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since…
Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…
For a noncommutative algebra $\mathcal{A}$ and an antilinear automorphism $\rho$ of $\mathcal{A}$, there is a notion of a positive trace. When we have a three-dimensional $\mathcal{N}=4$ gauge theory or four-dimensional $\mathcal{N}=2$…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…
In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…
This thesis takes inspiration from quantum physics to investigate mathematical structure that lies at the interface of algebra and statistics. The starting point is a passage from classical probability theory to quantum probability theory.…
Cartesian differential categories come equipped with a differential combinator which axiomatizes the fundamental properties of the total derivative from differential calculus. The objective of this paper is to understand when the Kleisli…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
We prove that if $K$ is a compact space and the space $P(K\times K)$ of regular probability measures on $K\times K$ has countable tightness in its $weak^*$ topology, then $L_1(\mu)$ is separable for every $\mu\in P(K)$. It has been known…