Synthesis of Mealy Machines Using Derivatives

Electronic Notes in Theoretical Computer Science

Volumn 164, Issue 1, 2006, Pages 27-45

  Hansen, Helle Hvid ^a   Costa, David ^b   Rutten, Jan ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

Author keywords

coalgebra; derivatives; Mealy machine; streams; synthesis

Indexed keywords

COALGEBRA; MEALY MACHINES; MEALY SYNTHESIS ALGORITHMS; STREAM FUNCTION DERIVATIVES;

ALGORITHMS; BINARY CODES; DERIVATIVES; FUNCTION EVALUATION; SPECIFICATIONS;

LINEAR ALGEBRA;

EID: 33749563362     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.06.003     Document Type: Article

References (16)

1. Antimirov V. Partial derivatives of regular expressions, and finite automaton constructions. Theoretical Computer Science 155 (1996) 291-319
2. Brzozowski J. Derivatives of regular expressions. Journal of the ACM 11 (1964) 481-494
3. Büchi J., and Landweber L. Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society 138 (1969) 295-311
4. Eilenberg S. Automata, Languages and Machines (Vol. A) (1974), Academic Press
5. Gouvêa F. p-adic Numbers (1993), Springer
6. Grabmayer C. Using proofs by coinduction to find "traditional" proofs. In: Fiadero J.L., et al. (Ed). Proceedings CALCO 2005. LNCS 3629 (2005) 175-193
7. Henzinger T., Krishnan S., Kupferman O., and Mang F. Synthesis of uninitialized systems. Proceedings ICALP 2002. LNCS 2380 (2002) 644-656
8. In: Jones S.P. (Ed). Haskell 98 Language and Libraries: the Revised Report (2003), Cambridge University Press. Haskell homepage: www.haskell.org
9. Kohavi Z. Switching and Finite Automata Theory (1978), McGraw-Hill
10. Pnueli A., and Rosner R. On the synthesis of a reactive module. Proceedings POPL 1989 (1989) 179-190
11. Redziejowski R. Construction of a deterministic ω-automaton using derivatives. Theoretical Informatics and Applications 33 (1999) 133-158
12. Rutten J. Behavioural differential equations: a coinductive calculus of streams, automata and power series. Theoretical Computer Science 308 (2003) 1-53
13. Rutten, J., Algebraic specification and coalgebraic synthesis of Mealy machines, Technical Report SENR0514, Centrum voor Wiskunde en Informatica (CWI) (2005), to appear in Proceedings FACS 2005
14. Sanchez C., Sipma H., Slanina M., and Manna Z. Final semantics for event-pattern reactive programs. In: Fiadero J.L., et al. (Ed). Proceedings CALCO 2005. LNCS 3629 (2005) 364-378
15. Vardi M. An automata-theoretic approach to fair realizability and synthesis. In: Wolper P. (Ed). Proceedings CAV 1995. LNCS 939 (1995) 267-278
16. Vuillemin J. On circuits and numbers. IEEE Transactions on Computers 43 (1994) 868-879