Abstract
We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every formula into a finite Mealy machine whose behaviour is exactly the set of causal functions satisfying the formula. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bonsangue, M. M., Rutten, J., & Silva, A. (2008). Coalgebraic logic and synthesis of mealy machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4962 LNCS, pp. 231–245). https://doi.org/10.1007/978-3-540-78499-9_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
