Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fixed point characterization of infinite behavior of finite-state systems
Theoretical Computer Science
Automata and Algebras in Categories
Automata and Algebras in Categories
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Exercises in coalgebraic specification
Algebraic and coalgebraic methods in the mathematics of program construction
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
The temporal logic of coalgebras via Galois algebras
Mathematical Structures in Computer Science
Closure Properties of Coalgebra Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Automata and Fixed Point Logics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM SIGACT News
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraising Subsequential Transducers
Electronic Notes in Theoretical Computer Science (ENTCS)
Predicate Liftings Versus Nabla Modalities
Electronic Notes in Theoretical Computer Science (ENTCS)
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F: Set to Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed F-coalgebras. The criterion under which such an automaton accepts or rejects a pointed coalgebra is formulated in terms of an infinite two-player graph game. We also introduce a language of coalgebraic fixed point logic for F-coalgebras, and we provide a game semantics for this language. Finally, we show that the two approaches are equivalent in expressive power. We prove that any coalgebraic fixed point formula can be transformed into an F-automaton that accepts precisely those pointed F-coalgebras in which the formula holds. And conversely, we prove that any F-automaton can be converted into an equivalent fixed point formula that characterizes the pointed F-coalgebras accepted by the automaton.