Coalgebraic Logic and Synthesis of Mealy Machines

DOI10.1007/978-3-540-78499-9_17zbMATH Open1137.68034OpenAlexW1706940874MaRDI QIDQ5458362FDOQ5458362

Authors: Marcello M. Bonsangue, Alexandra Silva, 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

Recommendations

• Synthesis of Mealy machines using derivatives
• scientific article; zbMATH DE number 2104638
• Symbolic synthesis of Mealy machines from arithmetic bitstream functions
• Coalgebraic logic
• Coalgebraic trace semantics via forgetful logics

Mathematics Subject Classification ID

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

Cited In (12)

• Synthesis of Mealy machines using derivatives
• Quantitative Kleene coalgebras
• Relational properties of sequential composition of coalgebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symbolic synthesis of Mealy machines from arithmetic bitstream functions
• (Co)algebraic characterizations of signal flow graphs
• Coalgebraic components in a many-sorted microcosm
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• A Kleene Theorem for Polynomial Coalgebras
• A description based on languages of the final non-deterministic automaton

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

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