English
Related papers

Related papers: Environmental Bisimulations for Delimited-Control …

200 papers

We systematically study various aspects of operator-valued multishifts. Beginning with basic properties, we show that the class of multishifts on the directed Cartesian product of rooted directed trees is contained in that of…

Functional Analysis · Mathematics 2019-04-02 Rajeev Gupta , Surjit Kumar , Shailesh Trivedi

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,…

Discrete Mathematics · Computer Science 2023-03-28 Jurriaan Rot , Thorsten Wißmann

The study of synchronization in biological systems is essential for the understanding of the rhythmic phenomena of living organisms at both molecular and cellular levels. In this paper, by using simple dynamical systems theory, we present a…

Molecular Networks · Quantitative Biology 2007-05-23 Chunguang Li , Luonan Chen , Kazuyuki Aihara

We present a variant of the theory of compatible functions on relations, due to Sangiorgi and Pous. We show that the up-to context proof technique for bisimulation is compatible in this setting for two subsets of the pi-calculus: the…

Logic in Computer Science · Computer Science 2022-06-06 Enguerrand Prebet

This paper studies the reduction (abstraction) of finite-state transition systems for control synthesis problems. We revisit the notion of alternating simulation equivalence (ASE), a more relaxed condition than alternating bisimulations, to…

Formal Languages and Automata Theory · Computer Science 2022-03-04 Gabriel de Albuquerque Gleizer , Khushraj Nanik Madnani , Manuel Mazo

Usage similarity estimation addresses the semantic proximity of word instances in different contexts. We apply contextualized (ELMo and BERT) word and sentence embeddings to this task, and propose supervised models that leverage these…

Computation and Language · Computer Science 2019-05-22 Aina Garí Soler , Marianna Apidianaki , Alexandre Allauzen

The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable. The decidability is proven in the framework of first-order grammars, which are given by…

Logic in Computer Science · Computer Science 2019-09-25 Petr Jancar

Synonymy and translational equivalence are the relations of sameness of meaning within and across languages. As the principal relations in wordnets and multi-wordnets, they are vital to computational lexical semantics, yet the field suffers…

Computation and Language · Computer Science 2020-12-15 Bradley Hauer , Grzegorz Kondrak

We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system. In the transformation based on 'context…

Logic in Computer Science · Computer Science 2015-07-01 Joerg Endrullis , Dimitri Hendriks

The problem of local feedback equivalence for 1-dimensional control systems of the 1-st order is considered. The algebra of differential invariants and criteria for the feedback equivalence for regular control systems are found.

Differential Geometry · Mathematics 2008-12-09 Valentin Lychagin

We revisit the standard bisimulation equalities in process models free of the restriction operator. As is well-known, in general the weak bisimilarity is coarser than the strong bisimilarity because it abstracts from internal actions. In…

Logic in Computer Science · Computer Science 2022-10-20 Xian Xu

Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…

Logic in Computer Science · Computer Science 2024-01-31 Linan Chen , Florence Clerc , Prakash Panangaden

The process of decomposing a complex system into simpler subsystems has been of interest to computer scientists over many decades, for instance, for the field of distributed computing. In this paper, motivated by the desire to distribute…

Formal Languages and Automata Theory · Computer Science 2019-08-26 Omar al Duhaiby , Jan Friso Groote

The paper outlines a new development in the Contextuality-by-Default theory as applied to finite systems of binary random variables. The logic and principles of the original theory remain unchanged, but the definition of contextuality of a…

Quantum Physics · Physics 2016-10-26 Ehtibar N. Dzhafarov , Janne V. Kujala

We consider notions of physical equivalence of sets of histories in the quantum mechanics of a closed system. We show first how the same set of histories can be relabeled in various ways, including the use of the Heisenberg equations of…

General Relativity and Quantum Cosmology · Physics 2008-02-03 Murray Gell-Mann , James B. Hartle

Transformer models using segment-based processing have been an effective architecture for simultaneous speech translation. However, such models create a context mismatch between training and inference environments, hindering potential…

Computation and Language · Computer Science 2023-07-06 Matthew Raffel , Drew Penney , Lizhong Chen

We examine an exactly solvable model of decoherence - a spin-system interacting with a collection of environment spins. We show that in this model (introduced some time ago to illustrate environment-induced superselection) generic…

Quantum Physics · Physics 2013-05-29 W. H. Zurek , F. M. Cucchietti , J. P. Paz

We describe a technique to emulate a two-level \PT-symmetric spin Hamiltonian, replete with gain and loss, using only the unitary dynamics of a larger quantum system. This we achieve by embedding the two-level system in question in a…

Quantum Physics · Physics 2023-07-20 D. Trypogeorgos , A. Valdés-Curiel , I. B. Spielman , C. Emary

We devise two complementary characterizations of hereditary history-preserving bisimilarity (HHPB): a denotational one, based on stable configuration structures, and an operational one, formulated in a reversible process calculus. Our…

Logic in Computer Science · Computer Science 2025-12-09 Marco Bernardo , Andrea Esposito , Claudio A. Mezzina

We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the…

Quantum Physics · Physics 2007-05-23 W. Dür , J. I. Cirac