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 / C. Bernardeschi;A. Bondavalli;L. Simoncini. - STAMPA. - 694:(1993), pp. 740-743. (Intervento presentato al convegno 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 tenutosi a deu nel 1993-June 14-18) [10.1007/3-540-56891-3_73].
From Data Flow Networks to Process Algebras
BONDAVALLI, ANDREA;
1993
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 | Dimensione | Formato | |
---|---|---|---|
BBS93-PARLE-34.pdf
Accesso chiuso
Tipologia:
Altro
Licenza:
Tutti i diritti riservati
Dimensione
18.54 kB
Formato
Adobe PDF
|
18.54 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.