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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bonsangue, M.M., Kurz, A.: Duality for logics of transition systems. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 455–469. Springer, Heidelberg (2005)
Bonsangue, M.M., Kurz, A.: Presenting functors by operations and equations. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 172–186. Springer, Heidelberg (2006)
Bonsangue, M.M., Rutten, J.J. M.M., Silva, A.: Coalgebraic Logic and Synthesis of Mealy Machines. CWI Technical report R0705 (2007)
Clarke, E.M., German, S.M., Lu, Y., Veith, H., Wang, D.: Executable protocol specification in esl. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 197–216. Springer, Heidelberg (2000)
Hansen, H.H., Costa, D., Rutten, J.J.M.M.: Synthesis of mealy machines using derivatives. ENTCS 164(1), 27–45 (2006)
Katis, P., Sabadini, N., Walters, R.F.C.: Feedback, trace and fixed-point semantics. ITA 36(2), 181–194 (2002)
Kozen, D.: Results on the propositional μ-calculus. TCS 27, 333–354 (1983)
Kupferman, O., Vardi, M.: μ-calculus synthesis. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 497–507. Springer, Heidelberg (2000)
Kupferman, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312–360 (2000)
Kupke, C., Venema, Y.: Coalgebraic automata theory: basic results. Technical Report SEN-E0701, CWI, The Netherlands (2007)
Marcovitz, A.B.: Introduction to Logic Design. McGraw-Hill, New York (2005)
Moss, L.: Coalgebraic logic. Annals of Pure and Applied Logic 96 (1999)
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179–190 (1989)
Rutten, J.J.M.M.: Algebraic specification and coalgebraic synthesis of mealy automata. ENTCS 160, 305–319 (2006)
Tini, S., Maggiolo-Schettini, A.: Compositional synthesis of generalized mealy machines. Fundam. Inform. 60(1–4), 367–382 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonsangue, M.M., Rutten, J., Silva, A. (2008). Coalgebraic Logic and Synthesis of Mealy Machines. In: Amadio, R. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2008. Lecture Notes in Computer Science, vol 4962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78499-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-78499-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78497-5
Online ISBN: 978-3-540-78499-9
eBook Packages: Computer ScienceComputer Science (R0)