Synthesis of mealy machines using derivatives (2006)
| Venue: | In: Proceedings of CMCS 2006. ENTCS |
| Citations: | 9 - 6 self |
BibTeX
@INPROCEEDINGS{Hansen06synthesisof,
author = {Helle Hvid Hansen and David Costa},
title = {Synthesis of mealy machines using derivatives},
booktitle = {In: Proceedings of CMCS 2006. ENTCS},
year = {2006},
pages = {2006},
publisher = {Elsevier}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
