For the most recent entries see the Petri Nets Newsletter.

Dataflow semantics for Petri nets.

Gold, R.

TU München, Institut für Informatik, Report TUM--I9107, SFB-Bericht 342/5/91 A, 25 pages, 1991.

Also in: Havel, I.M.; Koubek, V: Lecture Notes in Computer Science, Vol. 629; MFCS'92, Mathematical Foundations of Computer Science, 17th International Symposium, Prague, Czechoslovakia, Aug. 24-28, 1992, pages 275-283. Springer-Verlag, 1992.

Abstract: In this paper a semantics for Petri nets is developed, which describes the data and their transformation. This is useful especially for higher net classes since data can be easily modelled by higher Petri nets. Our semantics will therefore be data oriented, not action oriented like many other Petri net semantics. In our approach a Petri net is regarded as a module that transforms input data into output data. For that we divide the places of a net into input places (places with empty preset), output places (places with empty postset) and internal places. The internal places and the transitions are hidden from the outside and thus from observers. The input and output places form the interface to the environment. We will examine the functional dependence of the marking produced on the output places from the marking on the input places. Another property of our semantics is compositionality

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography