Related papers: On the Axiomatisability of Parallel Composition
Our paper presents an attempt to axiomatise signal processing. Our long-term goal is to formulate signal processing algorithms for an ideal world of exact computation and prove properties about them, then interpret these ideal formulations…
The overall problem addressed in this paper is the long-standing problem of program correctness, and in particular programs that describe systems of parallel executing processes. We propose a new method for proving correctness of parallel…
When two Markov operators commute, it suggests that we can couple two copies of one of the corresponding processes. We explicitly construct a number of couplings of this type for a commuting family of Markov processes on the set of…
We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from identical components. Symmetry is an important goal in the design of distributed systems,…
We investigate Bayesian non-parametric inference of the $\Lambda$-measure of $\Lambda$-coalescent processes with recurrent mutation, parametrised by probability measures on the unit interval. We give verifiable criteria on the prior for…
In this work the spectral theory of self-adjoint operator $A$ represented by Jacobi matrix is considered. The approach is based on the continued fraction representation of the resolvent matrix element of $A$. Different criteria of absolute…
The relationships between various equivalences on configuration structures, including interleaving bisimulation (IB), step bisimulation (SB) and hereditary history-preserving (HH) bisimulation, have been investigated by van Glabbeek and…
In this paper we study shorted operators relative to two different subspaces, for bounded operators on infinite dimensional Hilbert spaces. We define two notions of complementability in the sense of Ando for operators, and study the…
This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs that does not enable eliding of time-out transitions. Multiple equivalent definitions are procured, along with a modal characterisation and a…
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points (LP). However, LPs often hinder abstraction, and for some algorithms such as the…
This paper deals mainly with some aspects of the adjointable operators on Hilbert $C^*$-modules. A new tool called the generalized polar decomposition for each adjointable operator is introduced and clarified. As an application, the general…
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…
Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work…
We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. We start by considering the classic linear time-branching time spectrum developed by R.J.…
Flat iteration is a variation on the original binary version of the Kleene star operation P*Q, obtained by restricting the first argument to be a sum of atomic actions. It generalizes prefix iteration, in which the first argument is a…
A key requirement on any well-behaved process language is its compositionality: behavioural equivalence of processes should be respected by the constructors of the language. Turi and Plotkin's abstract GSOS provides an elegant bialgebraic…
We show that the space of trace-class operators on a Hilbert module over a commutative C*-algebra, as defined and studied in earlier work of Stern and van Suijlekom (Journal of Functional Analysis, 2021), is completely isometrically…
This paper proves that the equational theory of the class $RA_{\alpha}^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_{\alpha}^{cp}$, for finite $\alpha$. That is, substitutions of…
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching…