Related papers: Abstract Congruence Criteria for Weak Bisimilarity
We consider a field $f \circ T_1^{i_1} \circ \cdots \circ T_d^{i_d}$ where $T_1, \dots , T_d$ arecommuting transformations, one of them at least being ergodic. Considering the case of commuting filtrations, we are interested by giving…
Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a…
We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…
The theory of noninterference supports the analysis of information leakage and the execution of secure computations in multi-level security systems. Classical equivalence-based approaches to noninterference mainly rely on weak bisimulation…
Bisimulation metric is a robust behavioural semantics for probabilistic processes. Given any SOS specification of probabilistic processes, we provide a method to compute for each operator of the language its respective metric…
We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are correct in expectation on each member of an arbitrary…
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the…
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property fails by an…
In this paper we give a criterion that characterizes equivalent weak crossed products. By duality, we obtain a similar result for weak crossed coproducts and, as a consequence, we find the conditions that assures the equivalence between two…
This article is devoted to investigate a nonsmooth/nonconvex uncertain multiobjective optimization problem with composition fields (CUP) for brevity) over arbitrary Asplund spaces. Employing some advanced techniques of variational analysis…
The two model-theoretic concepts of weak saturation and weak amalgamation property are studied in the context of accessible categories. We relate these two concepts providing sufficient conditions for existence and uniqueness of weakly…
We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…
It is shown that a large class of properties coincide for weighted composition operators on a large class of weighted VMOA spaces, including the ones with logarithmic weights and the ones with standard weights $(1-|z|)^{-c}, \ 0\leq c<…
This paper discusses the problem of weakly supervised classification, in which instances are given weak labels that are produced by some label-corruption process. The goal is to derive conditions under which loss functions for weak-label…
We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…
We establish a framework for the study of the effective theory of weak convergence of measures. We define two effective notions of weak convergence of measures on $\mathbb{R}$: one uniform and one non-uniform. We show that these notions are…
This paper establishes a direct, robust and intimate connection between (i) non classicality tests for various quantum features, e.g., non-Boolean logic, quantum coherence, nonlocality, quantum entanglement, quantum discord; (ii) negative…
Serializability is a well-understood correctness criterion that simplifies reasoning about the behavior of concurrent transactions by ensuring they are isolated from each other while they execute. However, enforcing serializable isolation…