论文信息 - Software ENgineering Coalgebraic logic and synthesis of Mealy machines

Software ENgineering Coalgebraic logic and synthesis of Mealy machines

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. 2000 Mathematics Subject Classification: 03B7

M. M. Bonsangue | J. J. M. M. Rutten | A. M. Silva

[1] Marcello M. Bonsangue,et al. Duality for Logics of Transition Systems , 2005, FoSSaCS.

[2] Jan J. M. M. Rutten,et al. Algebraic Specification and Coalgebraic Synthesis of Mealy Automata , 2006, FACS.

[3] Amir Pnueli,et al. On the synthesis of a reactive module , 1989, POPL '89.

[4] Lawrence S. Moss,et al. Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[5] Helmut Veith,et al. Executable Protocol Specification in ESL , 2000, FMCAD.

[6] Pierre Wolper,et al. An automata-theoretic approach to branching-time model checking , 2000, JACM.

[7] Marcello M. Bonsangue,et al. Presenting Functors by Operations and Equations , 2006, FoSSaCS.

[8] Sajjan G. Shiva,et al. Introduction to Logic Design , 2018 .

[9] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .

[10] Orna Kupferman,et al. µ-Calculus Synthesis , 2000, MFCS.

[11] Dexter Kozen,et al. Results on the Propositional µ-Calculus , 1982, ICALP.

[12] Jan J. M. M. Rutten,et al. Synthesis of Mealy Machines Using Derivatives , 2006, CMCS.

[13] Andrea Maggiolo-Schettini,et al. Compositional Synthesis of Generalized Mealy Machines , 2004, Fundam. Informaticae.

[14] Yde Venema,et al. Coalgebraic Automata Theory: Basic Results , 2008, Log. Methods Comput. Sci..