Sciweavers

17 search results - page 1 / 4
» Automata for Coalgebras: An Approach Using Predicate Lifting...
Sort
View
ICALP
2010
Springer
13 years 9 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
APAL
2008
88views more  APAL 2008»
13 years 5 months ago
Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence
Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate ...
Ernst-Erich Doberkat
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
13 years 10 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin
APAL
1999
97views more  APAL 1999»
13 years 4 months ago
Coalgebraic Logic
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...
Lawrence S. Moss
LFCS
2009
Springer
13 years 9 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington