@conference {BRS08,
	title = {Coalgebraic logic and synthesis of mealy machines},
	booktitle = {Proceedings of the Eleventh International Conference on Foundations of Software Science and Computation structures (FoSSaCS 2008)},
	series = {Lecture Notes in Computer Science},
	volume = {4962},
	year = {2008},
	month = {April},
	pages = {231{\textendash}245},
	publisher = {Springer},
	organization = {Springer},
	address = {Grenoble, France},
	abstract = {<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>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/xana/files/mealy.pdf},
	author = {Marcello Bonsangue and Jan Rutten and Alexandra Silva}
}