We address the problem of the automatic design of automata to translatebetween different protocols, and we reduce it to the solution of equationsdefined over regular languages and finite automata (FA)/finite state machines(FSMs).The largest solution of the defined language equations includesall protocol converters that solve the problem;this is a strong advantage over computational techniques that deliver only oneor a few solutions, which might lead to suboptimal implementations(e.g., as sequential circuits).Our model is versatile, because it can handle different topologies andconstraints on the solutions.We propose a fully automatic procedure implemented inside a software packageBALM-II which solves language equations.For illustration we show examples of setting up and solving language equationsfor classical protocol mismatch problems, aiming at the design of protocolconverters to interface an alternating-bit (AB) sender and a non-sequenced(NS) receiver.Our automatic converter synthesis procedure yields a complete solutionfor automata and FSMs, and may serve as a core engineto embed into any full-fledged interface synthesis tool.

Automated synthesis of protocol converters with BALM-II

Castagnetti, Giovanni;Piccolo, Matteo;VILLA, Tiziano;
2015-01-01

Abstract

We address the problem of the automatic design of automata to translatebetween different protocols, and we reduce it to the solution of equationsdefined over regular languages and finite automata (FA)/finite state machines(FSMs).The largest solution of the defined language equations includesall protocol converters that solve the problem;this is a strong advantage over computational techniques that deliver only oneor a few solutions, which might lead to suboptimal implementations(e.g., as sequential circuits).Our model is versatile, because it can handle different topologies andconstraints on the solutions.We propose a fully automatic procedure implemented inside a software packageBALM-II which solves language equations.For illustration we show examples of setting up and solving language equationsfor classical protocol mismatch problems, aiming at the design of protocolconverters to interface an alternating-bit (AB) sender and a non-sequenced(NS) receiver.Our automatic converter synthesis procedure yields a complete solutionfor automata and FSMs, and may serve as a core engineto embed into any full-fledged interface synthesis tool.
978-3-662-49224-6
protocol converters, automated synthesis, language equations
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/934424
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact