Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...

Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in concurrency theory. Both models are commonly believed to be equi-expressive. One can find many ad-hoc embeddings of one of these models into the other. We build upon the seminal work of De Nicola and Vaandrager that firmly established the correspondence between stuttering equivalence in Kripke S...

We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory ...

Inspired by locale theory, we propose “pointfree convex geometry.” We introduce the notion of convexity algebra as pointfree convexity space. There are two notions of point for convexity algebra: one is chain-prime meet-complete filter and the other is maximal meet-complete filter. In this paper we show the following: (1) the former notion of point induces a dual equivalence between the categor...

We show equivalence of pure point diffraction and pure point dynamical spectrum for measurable dynamical systems built from locally finite measures on locally compact Abelian groups. This generalizes all earlier results of this type. Our approach is based on a study of almost periodicity in a Hilbert space. It allows us to set up a perturbation theory for arbitrary equivariant measurable pertur...

Techniques for reasoning about extensional properties of functional programs are well understood, but methods for analysing the underlying intensional or operational properties have been much neglected. This paper begins with the development of a simple but useful calculus for time analysis of non-strict functional programs with lazy lists. One limitation of this basic calculus is that the ordi...

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

Questions whether or not two grammars belonging to a family of grammars generate the same language have extensively been studied in the literature. These problems are called equivalence problems and if there exists an algorithm which for each pair of grammars of this family gives an answer to this question then the equivalence problem for this family of grammars is said to be decidable. Otherwi...

We study inference on parameters in censored panel data models, where the censoring can depend on both observable and unobservable variables in arbitrary ways. Under some general conditions, we characterize the information the model and data contain about the parameters of interest by deriving the identified sets, meaning that every parameter which belongs to these sets is observationally equiv...

Kingston (J Comb Theory (A) 20:357–363, 1976) and Anderson (J Comb Theory (A) 23:363, 1977) show that the probability that a given contestant wins a bestof-2k+1 series of asymmetric, zero-sum, binary-outcome games is, for a large class of assignment rules, independent of which contestant is assigned the advantageous role in each component game. We design a laboratory experiment to test this hyp...