Synthesis of Mealy Machines Using Derivatives

In Rutten (2005), the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic computation of the coalgebraic notion of stream function derivative, a generalisation of the Brzozowski derivative of regular expressions. In this paper we complete the construction of Mealy machines from specifications in both 2-adic and modulo-2 arithmetic by describing how we decide equivalence of expressions via reduction to normal forms; we present a Haskell implementation of this Mealy synthesis algorithm; and a theoretical result which characterises the (number of) states in Mealy machines constructed from rational 2-adic specifications.

[1]  G. N. Raney.  On continued fractions and finite automata , 1973 .

[2]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[3]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

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

[5]  César Sánchez,et al.  Final Semantics for Event-Pattern Reactive Programs , 2005, CALCO.

[6]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[7]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[8]  Clemens Grabmayer,et al.  Using Proofs by Coinduction to Find "Traditional" Proofs , 2005, CALCO.

[9]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[10]  George N. Raney,et al.  Sequential Functions , 1958, JACM.

[11]  Jan J. M. M. Rutten,et al.  Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[12]  Roman R. Redziejowski.  Construction of a deterministic -automaton using derivatives , 1999, RAIRO Theor. Informatics Appl..

[13]  G. N. Raney.  Functional composition patterns and power series reversion , 1960 .

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

[15]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Fair Realizability and Synthesis , 1995, CAV.

[16]  Valentin M. Antimirov.  Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..

[17]  Fernando Q. Gouvêa.  p -adic Numbers , 1993 .

[18]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[19]  Thomas A. Henzinger,et al.  Synthesis of Uninitialized Systems , 2002, ICALP.

[20]  Jean Vuillemin,et al.  On Circuits and Numbers , 1994, IEEE Trans. Computers.