%0 Conference Paper
%B Proceedings of the Eleventh International Conference on Foundations of Software Science and Computation structures (FoSSaCS 2008)
%D 2008
%T Coalgebraic logic and synthesis of mealy machines
%A Marcello Bonsangue
%A Jan Rutten
%A Alexandra Silva
%C Grenoble, France
%I Springer
%P 231–245
%S Lecture Notes in Computer Science
%V 4962
%X <p>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.</p>
%8 April
%> https://haslab.uminho.pt/sites/default/files/xana/files/mealy.pdf