Skip to Main content Skip to Navigation
Conference papers

Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors

Abstract : Categorical studies of recursive data structures and their associated reasoning principles have mostly focused on two extremes: initial algebras and induction, and final coalgebras and coinduction. In this paper we study their in-betweens. We formalize notions of alternating fixed points of functors using constructions that are similar to that of free monads. We find their use in categorical modeling of accepting run trees under the Büchi and parity acceptance condition. This modeling abstracts away from states of an automaton; it can thus be thought of as the “behaviors” of systems with the Büchi or parity conditions, in a way that follows the tradition of coalgebraic modeling of system behaviors.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-02044648
Contributor : Hal Ifip <>
Submitted on : Thursday, February 21, 2019 - 3:41:21 PM
Last modification on : Monday, May 17, 2021 - 12:00:05 PM
Long-term archiving on: : Thursday, May 23, 2019 - 12:03:54 AM

File

473364_1_En_12_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Natsuki Urabe, Ichiro Hasuo. Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors. 14th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2018, Thessaloniki, Greece. pp.214-234, ⟨10.1007/978-3-030-00389-0_12⟩. ⟨hal-02044648⟩

Share

Metrics

Record views

72

Files downloads

122