Results 1  10
of
145
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
, 1998
"... . The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendler in terms of a set functor. This coalgebraic formulation makes it possible to generalize the concepts to a ..."
Abstract

Cited by 104 (15 self)
 Add to MetaCart
. The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendler in terms of a set functor. This coalgebraic formulation makes it possible to generalize the concepts to a continuous setting involving Borel probability measures. Under reasonable conditions, generalized probabilistic bisimilarity can be characterized categorically. Application of the final coalgebra paradigm then yields an internally fully abstract semantical domain with respect to probabilistic bisimulation. Keywords. Bisimulation, probabilistic transition system, coalgebra, ultrametric space, Borel measure, final coalgebra. 1 Introduction For discrete probabilistic transition systems the notion of probabilistic bisimilarity of Larsen and Skou [LS91] is regarded as the basic process equivalence. The definition was given for reactive systems. However, Van Glabbeek, Smolka and Steffen s...
ORBIT INEQUIVALENT ACTIONS OF NONAMENABLE GROUPS
, 2008
"... Consider two free measure preserving group actions Γ � (X, µ), ∆ � (X, µ), and a measure preserving action ∆ � a (Z, ν) where (X, µ), (Z, ν) are standard probability spaces. We show how to construct free measure preserving actions Γ � c (Y, m), ∆ � d (Y, m) on a standard probability space such ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
(Show Context)
Consider two free measure preserving group actions Γ � (X, µ), ∆ � (X, µ), and a measure preserving action ∆ � a (Z, ν) where (X, µ), (Z, ν) are standard probability spaces. We show how to construct free measure preserving actions Γ � c (Y, m), ∆ � d (Y, m) on a standard probability space such that E d ∆ ⊂ E c Γ and d has a as a factor. This generalizes the standard notion of coinduction of actions of groups from actions of subgroups. We then use this construction to show that if Γ is a countable nonamenable group, then Γ admits continuum many orbit inequivalent free, measure preserving, ergodic actions on a standard probability space.
Visibly pushdown games
 In FSTTCS 2004
, 2004
"... Abstract. The class of visibly pushdown languages has been recently defined as a subclass of contextfree languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is gi ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
(Show Context)
Abstract. The class of visibly pushdown languages has been recently defined as a subclass of contextfree languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike pushdown games with pushdown winning conditions, visibly pushdown games are decidable and are 2Exptimecomplete. We also show that pushdown games against Ltl specifications and Caret specifications are 3Exptimecomplete. Finally, we establish the topological complexity of visibly pushdown languages by showing that they are a subclass of Boolean combinations of Σ3 sets. This leads to an alternative proof that visibly pushdown automata are not determinizable and also shows that visibly pushdown games are determined. 1
Monadic Second Order Logic on TreeLike Structures
, 1996
"... An operation M* which constructs from a given structure M a treelike structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such treelike structures is defined. It is shown that automata of this kind characterise expressive power of ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
An operation M* which constructs from a given structure M a treelike structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such treelike structures is defined. It is shown that automata of this kind characterise expressive power of monadic second order logic (MSOL) over treelike structures. Using this characterisation it is proved that MSOL theory of treelike structures is effectively reducible to that of the original structures. As another application of the characterisation it is shown that MSOL on trees of arbitrary degree is equivalent to first order logic extended with unary least fixpoint operator.
The BolzanoWeierstrass theorem is the jump of weak Kőnig’s lemma
 Annals of Pure and Applied Logic 163 (2012
"... iv ..."
(Show Context)
Duality for borel measurable cost function
"... measure theoretic setting. Our main result states that duality holds if c: X × Y → [0, ∞) is an arbitrary Borel measurable cost function on the product of Polish spaces X, Y. In the course of the proof we show how to relate a non optimal transport plan to the optimal transport costs via a “subsidy ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
measure theoretic setting. Our main result states that duality holds if c: X × Y → [0, ∞) is an arbitrary Borel measurable cost function on the product of Polish spaces X, Y. In the course of the proof we show how to relate a non optimal transport plan to the optimal transport costs via a “subsidy ” function and how to identify the dual optimizer. We also provide some examples showing the limitations of the duality relations. 1.
Weak MSO with the unbounding Quantifier
"... A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ωregular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic secondorder logic ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ωregular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic secondorder logic with a bounding quantifier). Effective translations between the logic and automata are given.
Reverse mathematics of MF spaces
, 2006
"... This paper gives a formalization of general topology in second order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF(P) denote the set of maximal filters on P endowed with the topology generated b ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
(Show Context)
This paper gives a formalization of general topology in second order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF(P) denote the set of maximal filters on P endowed with the topology generated by {Np  p ∈ P}, where Np = {F ∈ MF(P)  p ∈ F}. Define a countably based MF space to be a space of the form MF(P) for some countable poset P. The class of countably based MF spaces includes all complete separable metric spaces as well as many nonmetrizable spaces. The following reverse mathematics results are obtained. The proposition that every nonempty Gδ subset of a countably based MF space is homeomorphic to a countably based MF space is equivalent to Π11CA0 over ACA0. The proposition that every uncountable closed subset of a countably based MF space contains a perfect set is equivalent over Π11CA0 to the proposition that ℵL(A)1 is countable for all A ⊆ N. The proposition that every regular countably based MF space is homeomorphic to a complete separable metric space is equivalent to Π12CA0 over Π11CA0. 1 1
Games with winning conditions of high borel complexity
 In Proceedings of ICALP’04, volume 3142 of LNCS
, 2004
"... Abstract. We first consider infinite twoplayer games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We first consider infinite twoplayer games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary high finite Borel complexity. From this family, we deduce a family of decidable winning conditions of arbitrary finite Borel complexity for games played on finite graphs. The problem of deciding the winner for these winning conditions is shown to be nonelementary complete. Keywords: Pushdown Automata, Twoplayer Games, Borel Complexity. 1