Related papers: Abstract Congruence Criteria for Weak Bisimilarity
Let $(X_i)_{i\in\Z}$ be a regular stationary process for a given filtration. The weak invariance principle holds under the condition $\sum_{i\in\Z}\|P_0(X_i)\|_2<\infty$ (see Hannan (1979)}, Dedecker and Merlev\`ede (2003), Deddecker,…
The aim of this paper is to compare various criteria leading to the central limit theorem and the weak invariance principle. These criteria are the martingale-coboundary decomposition developed by Gordin in Dokl. Akad. Nauk SSSR 188 (1969),…
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More…
In this paper the concept of compatible weak factorization systems in general categories is introduced as a counterpart of compatible complete cotorsion pairs in abelian categories. We describe a method to construct model structures on…
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…
This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…
Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees compositionality, but seen from the point of view of stateful…
The standard engineering approach to modelling of complex systems is highly compositional. In order to be able to understand (or to control) the behavior of a complex dynamical systems, it is often desirable, if not necessary, to view this…
Establishing equivalences between programs or systems is crucial both for verifying correctness of programs, by establishing that two implementations are equivalent, and for justifying optimisations and program transformations, by…
Inspired by Hintikka's treatment of question embedding verbs in [8] and the variations of noncontingency operator, we propose a logic with strong noncontingency operator $\blacktriangle$ as the only primitive modality. A proposition is…
We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to…
In this project, we have extended previous work on the formalization of the process algebra CCS in HOL4. We have added full supports on weak bisimulation equivalence and observation congruence (rooted weak equivalence), with related…
Memory consistency models define the order in which accesses to shared memory in a concurrent system may be observed to occur. Such models are a necessity since program order is not a reliable indicator of execution order, due to…
In a recent paper, we have introduced two types of fuzzy simulations (forward and backward) and five types of fuzzy bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models for the fuzzy…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
We define a notion of normal form bisimilarity for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. Normal form bisimilarities are simple, easy-to-use behavioral equivalences which…
The predominant challenge in weakly supervised semantic parsing is that of spurious programs that evaluate to correct answers for the wrong reasons. Prior work uses elaborate search strategies to mitigate the prevalence of spurious…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
This paper formulates and studies the concepts of approximate (alternating) bisimulation relations characterizing equivalence relations between interconnected systems and their abstractions. These equivalence relations guarantee that the…