Sciweavers

Share
ENTCS
2006

Synthesis of Mealy Machines Using Derivatives

10 years 10 months ago
Synthesis of Mealy Machines Using Derivatives
In Rutten [13] 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. Key words: Mealy machine, synthesis, derivatives, streams, coalgebra.
Helle Hvid Hansen, David Costa, Jan J. M. M. Rutte
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where ENTCS
Authors Helle Hvid Hansen, David Costa, Jan J. M. M. Rutten
Comments (0)
books