Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

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

Natsuki Urabe
  • Function : Author
  • PersonId : 1043057
Ichiro Hasuo

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.
Fichier principal
Vignette du fichier
473364_1_En_12_Chapter.pdf (468.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02044648 , version 1 (21-02-2019)

Licence

Attribution

Identifiers

Cite

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⟩
50 View
133 Download

Altmetric

Share

Gmail Facebook X LinkedIn More