Coalgebraic logic and synthesis of mealy machines
- Citation:
- Bonsangue M, Rutten J, Silva A. 2008. Coalgebraic logic and synthesis of mealy machines. Proceedings of the Eleventh International Conference on Foundations of Software Science and Computation structures (FoSSaCS 2008). 4962:231–245.
Tertiary Title:
Lecture Notes in Computer ScienceDate Presented:
AprilAbstract:
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:
BRS08DOI:
10.1007/978-3-540-78499-9_17
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.