Related papers: Abstract Congruence Criteria for Weak Bisimilarity
This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is…
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution…
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to…
We provide a categorical notion called uncertain bisimilarity, which allows to reason about bisimilarity in combination with a lack of knowledge about the involved systems. Such uncertainty arises naturally in automata learning algorithms,…
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal {\epsilon}-subdifferentials, by incorporating the moduli of weak convexity of the functions into the respective formulas.…
The classical binary hypothesis testing problem is revisited. We notice that when one of the hypotheses is composite, there is an inherent difficulty in defining an optimality criterion that is both informative and well-justified. For…
Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…
In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linearizable. However, linearizability is not compositional when…
Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the observational power of program terms. The key desideratum for any…
Our objective is to extend the standard results of preservation and reflection of properties by bisimulations to the coalgebraic setting, as well as to study under what conditions these results hold for simulations. The notion of…
We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose…
Applicative bisimilarity is a coinductive characterisation of observational equivalence in call-by-name lambda-calculus, introduced by Abramsky (1990). Howe (1996) gave a direct proof that it is a congruence, and generalised the result to…
In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators $Re(\lambda)^\einhalb C(\lambda+A)^{-1}, \qquad Re(\lambda)>0$ on the complex right half plane and weak Lebesgue…
We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…
Applicative bisimulation is a coinductive technique to check program equivalence in higher-order functional languages. It is known to be sound, and sometimes complete, with respect to context equivalence. In this paper we show that…
The aim of this article is to refine a weak invariance principle for stationary sequences given by Doukhan & Louhichi (1999). Since our conditions are not causal our assumptions need to be stronger than the mixing and causal $\theta$-weak…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
Let \( A \subset M \) be an inclusion of von Neumann algebras equipped with a faithful normal semifinite operator valued weight \( E \colon M \to A \). We prove that every positive element \( x \in M \) with \( E(x) < \infty \) satisfies…
We propose a notion of alternating bisimulation for strategic abilities under imperfect information. The bisimulation preserves formulas of ATL$^*$ for both the {\em objective} and {\em subjective} variants of the state-based semantics with…