Coalgebraic Logic and Synthesis of Mealy Machines

DOI10.1007/978-3-540-78499-9_17zbMath1137.68034OpenAlexW1706940874MaRDI QIDQ5458362

Alexandra Silva, Marcello M. Bonsangue, Jan J. M. M. Rutten

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Coalgebraic Components in a Many-Sorted Microcosm ⋮ Relational properties of sequential composition of coalgebras ⋮ A description based on languages of the final non-deterministic automaton ⋮ Quantitative Kleene coalgebras ⋮ (Co)Algebraic Characterizations of Signal Flow Graphs ⋮ A Kleene Theorem for Polynomial Coalgebras ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Unnamed Item

This page was built for publication: Coalgebraic Logic and Synthesis of Mealy Machines