We have defined a transformation γ from data flow networks to process algebras specifications. The behaviour of γ(N) in terms of the interleaving of observable actions corresponds to the traces of network N in the traces model. This opens the possibility of applying the tools and the theory developed for the process algebras to analyse data flow networks. An important field is verification where the tools of the process algebras can be significantly applied to prove networks equivalence.
From Data Flow Networks to process Algebras
A. Bondavalli;BERNARDESCHI, CINZIA;
1993-01-01
Abstract
We have defined a transformation γ from data flow networks to process algebras specifications. The behaviour of γ(N) in terms of the interleaving of observable actions corresponds to the traces of network N in the traces model. This opens the possibility of applying the tools and the theory developed for the process algebras to analyse data flow networks. An important field is verification where the tools of the process algebras can be significantly applied to prove networks equivalence.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.
