A formalism for the synthesis of efficient controllers for discrete event systems

We propose a formalism for the synthesis of “functions”, called computation boxes (C-boxes), which possess memory: arguments are put into them and results are gotten from them, avoiding unnecessary computations and possibly using previously calculated intermediate results. C-boxes may be “functionally” composed in graph-like structures, thus allowing modularity and reusability. Different languages may be used to implement computations. C-boxes may be externally specified by means of purely functional specifications called extended functions (E-functions), without bothering about their internal structure. These characteristics make C-boxes particularly well-suited to be used as a software engineering formalism to synthesize efficient controllers for discrete event systems in a clear and modular way