2008
Coalgebraic logic and synthesis of Mealy machines
Publication
Publication
Presented at the
Conference on Foundations of Software Science and Computation Structures, Budapest, Hungary
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.
| Additional Metadata | |
|---|---|
| , , | |
| , | |
| Springer | |
| R. Amadio | |
| Lecture Notes in Computer Science | |
| Conference on Foundations of Software Science and Computation Structures | |
| Organisation | Computer Security |
|
Bonsangue, M., Rutten, J., & Silva, A. (2008). Coalgebraic logic and synthesis of Mealy machines. In R. Amadio (Ed.), Lecture Notes in Computer Science. Springer. |
|