Coalgebraic logic and synthesis of Mealy machines

Citation:
Bonsangue M, Rutten J, Silva A.  2007.  Coalgebraic logic and synthesis of Mealy machines. :1-15.

Report Number:

SEN-0705

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.

Citation Key:

BRS07a
PreviewAttachmentSize
11925d.pdf388.25 KB