Related papers: Coalgebraic Weak Bisimulation from Recursive Equat…
The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to calculate strong bisimulation using parallel random access…
We introduce Integrated Weak Learning, a principled framework that integrates weak supervision into the training process of machine learning models. Our approach jointly trains the end-model and a label model that aggregates multiple…
A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…
Under appropriate conditions, if one picks a commutative algebra A with action of group G in braided monoidal category C, the category of A modules in C obtains a natural crossed G-braided structure. In the case of general commutative…
Weak-type quasi-norms are defined using the mean oscillation or the mean of a function on dyadic cubes, providing discrete analogues and variants of the corresponding quasi-norms on the upper half-space previously considered in the…
A large literature has grown up around the proposed use of 'weak measurements' (i.e., unsharp measurements followed by post-selection) to allegedly provide information about hidden ontological features of quantum systems. This paper…
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible…
A weakly equivariant Hopf algebra is a Hopf algebra A with an action of a finite group G up to inner automorphisms. We show that each weakly equivariant Hopf algebra can be replaced by a Morita equivalent algebra B with a strict action of G…
In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based…
One of the remarkable notions in the recent development of quantum physics is the weak value related to weak measurements. We emulate it as a two-time conditional expectation in a classical stochastic model. We use the well known…
We investigate if an existing notion of weak sequential convergence in a Hadamard space can be induced by a topology. We provide an answer on what we call weakly proper Hadamard spaces. A notion of dual space is proposed and it is shown…
We consider a class of second order ordinary differential equations describing one-dimensional systems with a quasi-periodic analytic forcing term and in the presence of damping. As a physical application one can think of a…
The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…
A famous result by Milner is that the lambda-calculus can be simulated inside the pi-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between beta-reduction and how it…
Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some…
This paper provides a fully abstract semantics for value-passing CCS for trees (VCCTS). The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. The labelled transition…
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of…
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the…