A coalgebraic take on regular and -regular behaviours
arXiv:1902.02601 · doi:10.46298/lmcs-17(4:24)2021
Abstract
We present a general coalgebraic setting in which we define finite and infinite behaviour with Büchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad suitable for modelling (in)finite behaviour. The second part of the paper focuses on presenting the concepts of a (coalgebraic) automaton and its (-) behaviour. We end the paper with coalgebraic Kleene-type theorems for (-) regular input. The framework is instantiated on non-deterministic (Büchi) automata, tree automata and probabilistic automata.
References in corpus (9)
- Generic Trace Semantics via Coinduction
- Seven Sketches in Compositionality: An Invitation to Applied Category Theory
- Behavioural equivalences for coalgebras with unobservable moves
- Weak bisimulation for coalgebras over order enriched monads
- How to Kill Epsilons with a Dagger -- A Coalgebraic Take on Systems with Algebraic Label Structure
- Corecursive Algebras, Corecursive Monads and Bloom Monads
- Coalgebraic Infinite Traces and Kleisli Simulations
- Coalgebraic Trace Semantics for Buechi and Parity Automata
- Behavioural equivalences for timed systems