Related papers: Relating Apartness and Bisimulation
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques in a fibrational setting,…
Representing the semantic relations that exist between two given words (or entities) is an important first step in a wide-range of NLP applications such as analogical reasoning, knowledge base completion and relational information…
Using approximations, we give several characterizations of separability of bimodules. We also discuss how separability properties can be used to transfer some representation theoretic properties from one ring to another one: contravariant…
In this paper we introduce and investigate the notion of semiseparable functor. One of its first features is that it allows a novel description of separable and naturally full functors in terms of faithful and full functors, respectively.…
Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings. As such they constitute a convenient modeling instrument to deal with…
This work is an enquiry into the circumstances under which entropy methods can give an answer to the questions of both quantum separability and classical correlations of a composite state. Several entropy functionals are employed to examine…
Two subsets $A, B$ of the plane are betweenness isomorphic if there is a bijection $f\colon A\to B$ such that, for every $x,y,z\in A$, the point $f(z)$ lies on the line segment connecting $f(x)$ and $f(y)$ if and only if $z$ lies on the…
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…
To refine formal methods for concurrent systems, there are several ways of enriching classical operational semantics of process calculi. One can enable the auditing and undoing of past synchronisations thanks to communication keys, thus…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invariant queries in P are exactly those that are definable in the…
In the case of systems composed of identical particles, a typical instance in quantum statistical mechanics, the standard approach to separability and entanglement ought to be reformulated and rephrased in terms of correlations between…
We investigate how various forms of bisimulation can be characterised using the technology of logical relations. The approach taken is that each form of bisimulation corresponds to an algebraic structure derived from a transition system,…
Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic…
We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…
Separable Bayesian Networks, or the Influence Model, are dynamic Bayesian Networks in which the conditional probability distribution can be separated into a function of only the marginal distribution of a node's neighbors, instead of the…
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…
Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…
We introduce an algebra qCCS of pure quantum processes in which no classical data is involved, communications by moving quantum states physically are allowed, and computations is modeled by super-operators. An operational semantics of qCCS…
The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the…