From data flow networks to process algebras
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.
Unable to display preview. Download preview PDF.
- T. Bolognesi, E. Brinskma, “Introduction to the ISO specification language LOTOS”, “The formal description technique LOTOS”, Elsevier Science Publishers B.V. (North-Holland), 1989, pp. 23–73.Google Scholar
- J. Brock, W. Ackerman, “Scenarios: A Model of Non-determinate Computation”, “LNCS 107”, Springer-Verlag, 1981, pp. 252–259.Google Scholar
- ISO, “LOTOS — A Formal Technique Based on the Temporal Ordering of Observational Behaviour”, Open Systems Interconnection, July 1988.Google Scholar
- B. Jonsson, “A Fully Abstract Trace Model for Data Flow networks”, Journal of ACM, Vol. 36, pp. 155–165, 1989.Google Scholar
- C. Bernardeschi, A. Bondavalli, L. Simoncini, “A Semantic Model of Data Flow Networks based on Process Algebras”, CNUCE Internal Report C93-03, March 1993.Google Scholar