A Petri nets semantics for data flow networks (original) (raw)

Access this article

Log in via an institution

Subscribe and save

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. C. Bernardeschi, N. De Francesco, G. Vaglini: Non-sequential processes for FIFO-nets. Internal Report IR-14/93, Dipartimento di Ingegneria dell'Informazione, Università di Pisa, Italy
  2. J. Brock, W. Ackerman: Scenarios: A Model of Non-determinate Computation. In_Formalization of Programming Concepts, LNCS 107_, pp. 252–259, 1981
  3. N. De Francesco, U. Montanari, G. Ristori: Modelling Serializability via Process Equivalence in Petri Nets. HP-TR. HPL-92-89, July 1992
  4. P. Degano, J. Meseguer, U. Montanari: Axiomatizing net computations and processes. In_Proc. 4-th Annual Symposium on Logic in Computer Science_, Asilomar, California, pp. 175–185, 1989
  5. H. Gaifman, V. Pratt: Partial Order Models of Concurrency and the Computation of Functions. In Symposium on_Logic in Computer Science_, Ithaca, New York, pp. 72–85, June 1987
  6. U. Goltz, W. Reisig: The Non-sequential Behaviour of Petri Nets. In_Information and Computation 57_, pp. 125–147, 1983
  7. I. Guessarian (ed.): Semantics of Systems of Concurrent Processes. In_Proc. LITP Spring School on Theoretical Computer Science, LNCS 469_, La Roche Posay, France, 1990
  8. B. Jonsson: A Fully Abstract Trace Model for Data Flow networks. In_16th Annual ACM Symp. on Principles of Programming Languages_, pp. 155–165, 1989
  9. B. Jonsson, J.N. Kok: Comparing Two Fully Abstract Data Flow Models.LNCS 379, pp. 217–234, 1989
    Google Scholar
  10. G. Kahn: The semantics of a simple language for parallel programming. In_Information Processing 74_, Noth-Holland, pp. 471–475, 1974
  11. K. Kavi, B. Buckles, U. Bhat: Isomorphism Between Petri Nets and Data flow graphs.IEEE TSE, vol. SE-13, n 10, pp. 1127–1134, 1987
    Google Scholar
  12. D.E. Knuth: The Art of Computer Programming.Fundamental Algorithms, 2nd ed., Addison-Wesley, Reading, Mass., 1973
    Google Scholar
  13. J. Kok: A Fully Abstract Semantics for Data Flow Nets. In_Proc. PARLE, LNCS 259_, Springer-Verlag, pp. 351–368, 1987
  14. P.R. Kosinski: A Straightforward Denotational Semantics for Non-Determinate Data Flow Programs. In_Proc. 5th ACM Symp. on Principles of Programming Languages_, pp. 214–219, 1978
  15. R. Milner: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989
  16. C.A. Petri: Non-sequential Processes.GMD-ISF Report 77-05, 1977
  17. A. Rabinovich, B. Trakhtenbrot: Nets of processes and data flow.Proc. Rex Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pp. 574–602, 1988
  18. A. Rabinovich, B. Trakhtenbrot: Behaviour structures and nets.Fundamenta Informaticae, vol. 11, n 4, pp. 357–404, 1989
    Google Scholar
  19. A. Rabinovich, B. Trakhtenbrot: Nets and data flow interpreters.Proc. 4 th Annual Symposium on Logic in Computer Science, pp. 164–174, 1989
  20. W. Reisig: Petri nets—an introduction.EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag, 1985
  21. G. Rozenberg (ed.): Advances in Petri nets 1990.LNCS 483, Springer Verlag, 1991
  22. G. Rozenberg (ed.): Advances in Petri nets 1991.LNCS 524, Springer Verlag, 1991
  23. G. Roucairol: FIFO-nets.Petri Nets: Central Models and Their Properties, LNCS 254, Springer Verlag, pp. 436–459, 1986
  24. J. R. Russell: Full abstraction for nondeterministic data flow networks.Proc. of the 30 th Annual Symposium on Foundation of Computer Science, IEEE Press, pp. 170–177, 1989
  25. J. Staples, V.L. Nguyen: A Fixpoint Semantics for Nondeterministic Data-flow.JACM, 32, 2, pp. 411–444, 1985
    Google Scholar
  26. E.W. Stark: A Simple Generalization of Kahn's Principle to Inderminate Data Flow Networks.Semantics for Concurrency, Leicester, Springer Verlag, pp. 157–176, 1990

Download references