8 search results - page 1 / 2 » Automata and fixed point logic: A coalgebraic perspective |
IANDC
2006
13 years 4 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the
ENTCS
2008
13 years 4 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...
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...