16 search results - page 1 / 4 » Coalgebraic Automata Theory: Basic Results |
CORR
2008
Springer
13 years 5 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...
IANDC
2010
13 years 3 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
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...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
FMCO
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. This paper provides an overview of an approach to coalgebraic modelling and refinement of state-based software components, summing up some basic results and introducing a...