The formalism of generalized probabilistic theories (GPTs) was originally developed as a way to characterize the landscape conceivable physical theories. Thus, GPT describing given theory necessarily includes all physically possible processes. We here consider question how provide GPT-like characterization particular experimental setup within theory. show that resulting is not generally in and ...

In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notion of bisimulation introduced by R. Milner for labeled transition systems. It is however, more subtle than its namesake in concurrency theory, mainly due to the fact that here, one deals with relations on manifolds. We ...

An examination of the translation invariance of V0 under dyadic rationals is presented, generating a new equivalence relation on the collection of wavelets. The equivalence classes under this relation are completely characterized in terms of the support of the Fourier transform of the wavelet. Using operator interpolation, it is shown that several equivalence classes are non-empty.

This paper is a contribution to the study of Borel equivalence relations in standard Borel spaces, i.e., Polish spaces equipped with their Borel structure. A class of such equivalence relations which has received particular attention is the class of hyperfinite Borel equivalence relations. These can be defined as the increasing unions of sequences of Borel equivalence relations all of whose equ...

People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.

This paper presents a new characterization of the bisimulation congruence and D{bisimulation equivalences of the {calculus. The characterization supports a bisimulation{like proof technique which avoids explicit case analysis by taking a dynamic point of view of actions a process may perform , thus providing a new way of proving bisimulation congruence. The semantic theory of the {calculus is p...

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...