Results 1  10
of
400
Coalgebraic Logic
 Annals of Pure and Applied Logic
, 1999
"... We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that infinitary modal logic contains characterizing formulas. That is, every modelworld pair is characterized up to bisimulation by an infinitary formula. The ..."
Abstract

Cited by 108 (0 self)
 Add to MetaCart
(Show Context)
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that infinitary modal logic contains characterizing formulas. That is, every modelworld pair is characterized up to bisimulation by an infinitary formula. The point of our generalization is to understand this on a deeper level. We do this by studying a frangment of infinitary modal logic which contains the characterizing formulas and is closed under infinitary conjunction and an operation called 4. This fragment generalizes to a wide range of coalgebraic logics. We then apply the characterization result to get representation theorems for final coalgebras in terms of maximal elements of ordered algebras. The end result is that the formulas of coalgebraic logics can be viewed as approximations to the elements of the final coalgebra. Keywords: infinitary modal logic, characterization theorem, functor on sets, coalgebra, greatest fixed point. 1 Intr...
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 106 (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...
Abstract behavior types: A foundation model for components and their composition
 SCIENCE OF COMPUTER PROGRAMMING
, 2003
"... ..."
(Show Context)
Automata and coinduction (an exercise in coalgebra
 LNCS
, 1998
"... The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which ..."
Abstract

Cited by 87 (19 self)
 Add to MetaCart
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra.
A Coinductive Calculus of Component Connectors
, 2002
"... Reo is a recently introduced channelbased coordination model, wherein complex coordinators, called connectors, are compositionally built out of simpler ones. Using a more liberal notion of a channel, Reo generalises existing dataflow networks. In this paper, we present a simple and transparent sema ..."
Abstract

Cited by 74 (30 self)
 Add to MetaCart
Reo is a recently introduced channelbased coordination model, wherein complex coordinators, called connectors, are compositionally built out of simpler ones. Using a more liberal notion of a channel, Reo generalises existing dataflow networks. In this paper, we present a simple and transparent semantical model for Reo, in which connectors are relations on timed data streams. Timed data streams constitute a characteristic of our model and consist of twin pairs of separate data and time streams. Furthermore, coinduction is our main reasoning principle and we use it to prove properties such as connector equivalence.
A Hierarchy of Probabilistic System Types
, 2003
"... We study various notions of probabilistic bisimulation from a coalgebraic point of view, accumulating in a hierarchy of probabilistic system types. In general, a natural transformation between two Setfunctors straightforwardly gives rise to a transformation of coalgebras for the respective functors ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
We study various notions of probabilistic bisimulation from a coalgebraic point of view, accumulating in a hierarchy of probabilistic system types. In general, a natural transformation between two Setfunctors straightforwardly gives rise to a transformation of coalgebras for the respective functors. This latter transformation preserves homomorphisms and thus bisimulations. For comparison of probabilistic system types we also need reflection of bisimulation. We build the hierarchy of probabilistic systems by exploiting the new result that the transformation also reflects bisimulation in case the natural transformation is componentwise injective and the first functor preserves weak pullbacks. Additionally, we illustrate the correspondence of concrete and coalgebraic bisimulation in the case of general Segalatype systems.
History Dependent Automata
, 2001
"... In this paper we present historydependent automata (HDautomata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with historydependent formalisms. In a historydependent formalism the actions that a system can perform carry information generated i ..."
Abstract

Cited by 50 (11 self)
 Add to MetaCart
In this paper we present historydependent automata (HDautomata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with historydependent formalisms. In a historydependent formalism the actions that a system can perform carry information generated in the past history of the system. The most interesting example is calculus: channel names can be created by some actions and they can then be referenced by successive actions. Other examples are CCS with localities and the historypreserving semantics of Petri nets. Ordinary
PSPACE bounds for rank 1 modal logics
 IN LICS’06
, 2006
"... For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a sh ..."
Abstract

Cited by 37 (19 self)
 Add to MetaCart
(Show Context)
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACEbounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant prooftheoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way.