831 search results - page 5 / 167 » Coalgebraic Correspondence Theory |
87
Voted
CALCO
2009
Springer
15 years 6 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...
96
Voted
APAL
1999
14 years 11 months ago
1999
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...
ENTCS
2008
14 years 11 months ago
2008
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
93
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...