%0 Report
%D 2007
%T Coalgebraic logic and synthesis of Mealy machines
%A Marcello Bonsangue
%A Jan Rutten
%A Alexandra Silva
%C Amsterdam, The Netherlands
%I Centrum Wiskunde & Informatica (CWI)
%P 1-15
%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>
%> https://haslab.uminho.pt/sites/default/files/xana/files/11925d.pdf