Coalgebraic semantics for nominal automata

DOI10.1007/978-3-031-10736-8_3MaRDI QIDQ2104476zbMATH OpenOpenAlexFDO

Authors Florian Frank, Stefan Milius, Henning Urbat

Publication date 7 December 2022

Full work available at URL https://arxiv.org/abs/2202.06546

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 431762 (Why is no real title available?)
• scientific article; zbMATH DE number 3989612 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 7649944 (Why is no real title available?)
• A class of automata for the verification of infinite, resource-allocating behaviours
• A coalgebraic view of \(\varepsilon \)-transitions
• A fixpoint theorem for complete categories
• A new foundation for finitary corecursion and iterative algebras
• Adjoint Lifting Theorems for Categories of Algebras
• Automata theory in nominal sets
• Checking NFA equivalence with bisimulations up to congruence
• Coalgebraic bisimulation-up-to
• Coalgebraic characterizations of context-free languages
• Complete iterativity for algebras with effects
• Context-free coalgebras
• Finite-memory automata
• Foundations of nominal techniques: logic and semantics of variables in abstract syntax
• Generalizing determinization from automata to coalgebras
• Generic Trace Semantics via Coinduction
• Introduction to coalgebra. Towards mathematics of states and observation
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• Lifting theorems for Kleisli categories
• Monads on symmetric monoidal closed categories
• Nominal Kleene coalgebra
• Nominal automata with name binding
• Nominal sets. Names and symmetry in computer science
• Notions of computation and monads
• Runtime verification based on register automata
• Sound and complete axiomatizations of coalgebraic language equivalence
• Structural induction and coinduction in a fibrational setting
• The Category-Theoretic Solution of Recursive Domain Equations
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Toward a uniform theory of effectful state machines
• Trace semantics via determinization
• Une théorie combinatoire des séries formelles
• Universal coalgebra: A theory of systems

Cited in

(5)

• Coalgebras for Bisimulation of Weighted Automata over Semirings
• Coalgebraic Semantics of Heavy-Weighted Automata
• scientific article; zbMATH DE number 6851946 (Why is no real title available?)
• Coalgebraic Automata Theory: Basic Results
• Symbolic and Asynchronous Semantics via Normalized Coalgebras

This page was built for publication: Coalgebraic semantics for nominal automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104476)