Name
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. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-56891-3_73 | PARLE |
Keywords | Field | DocType |
data flow networks,process algebras,assessment,data flow,process algebra,dependability,reliability,verification | Dependability,Observable,Computer science,Theoretical computer science,Equivalence (measure theory),Interleaving,Data flow diagram | Conference |
ISBN | Citations | PageRank |
3-540-56891-3 | 2 | 0.38 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cinzia Bernardeschi | 1 | 226 | 31.87 |
| Andrea Bondavalli | 2 | 886 | 133.06 |
| Luca Simoncini | 3 | 184 | 24.69 |