Generalizing determinization from automata to coalgebras
From MaRDI portal
Publication:4913772
DOI10.2168/LMCS-9(1:9)2013zbMath1262.18002arXiv1302.1046MaRDI QIDQ4913772
Marcello M. Bonsangue, Alexandra Silva, Filippo Bonchi, Jan J. M. M. Rutten
Publication date: 9 April 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.1046
Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)
Related Items
Iterated covariant powerset is not a monad, Final Semantics for Decorated Traces, Unnamed Item, Coalgebraic constructions of canonical nondeterministic automata, Behavioural equivalences for coalgebras with unobservable moves, Preservation and reflection of bisimilarity via invertible steps, A (co)algebraic theory of succinct automata, Unnamed Item, Unnamed Item, Up-to techniques for behavioural metrics via fibrations, Lattices do not distribute over powerset, Coalgebraic trace semantics via forgetful logics, Unnamed Item, A description based on languages of the final non-deterministic automaton, Combining semilattices and semimodules, Up-To Techniques for Behavioural Metrics via Fibrations, From generic partition refinement to weighted tree automata minimization, Unnamed Item, A Final Coalgebra for k-regular Sequences, Product Rules and Distributive Laws, Predicate liftings and functor presentations in coalgebraic expression languages, Long-term values in Markov decision processes, (co)algebraically, (in)finite trace equivalence of probabilistic transition systems, Steps and traces, On algebras with effectful iteration, Unnamed Item, A New Foundation for Finitary Corecursion, A new foundation for finitary corecursion and iterative algebras, Simplified Coalgebraic Trace Equivalence, Trace semantics via determinization, Coalgebraic semantics for nominal automata
