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
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
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)
Terminal Sequence Induction via Games
Logic, Language, and Computation
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Complementation of coalgebra automata
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
Automata for coalgebras: an approach using predicate liftings
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On monotone modalities and adjointness
Mathematical Structures in Computer Science
Model constructions for moss' coalgebraic logic
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Relation liftings on preorders and posets
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Model checking linear coalgebraic temporal logics: an automata-theoretic approach
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
The Logic of Exact Covers: Completeness and Uniform Interpolation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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.