# A Petri nets semantics for data flow networks

@article{Bernardeschi2005APN, title={A Petri nets semantics for data flow networks}, author={Cinzia Bernardeschi and Nicoletta De Francesco and Gigliola Vaglini}, journal={Acta Informatica}, year={2005}, volume={32}, pages={347-374} }

This work presents a truly concurrent operational semantics for nondeterministic data flow networks. We introduce a model, the df-process, which is a notion similar to that of non-sequential process for a Petri net: a df-process is defined as a mapping from an occurrence net K to a data flow net N, such that the places and the transitions of K are mapped onto the channels and the nodes of N. A df-process contains, by means of some labelling of the places, information on the value and the order…

## One Citation

Dataflow orchestration of image processing algorithms using high-level petri nets

- Computer Science7th International Conference on Hybrid Intelligent Systems (HIS 2007)
- 2007

A new way of modeling image-processing algorithms for distributed systems using high level Petri-nets using dataflow networks of basic building blocks is presented and the implementation of a distributed service-oriented industrial image- processing system is presented.

## References

SHOWING 1-10 OF 22 REFERENCES

A fixpoint semantics for nondeterministic data flow

- Computer ScienceJACM
- 1985

The main result is that the operation of forming a process from a network of component processes is associative, which shows that the approach is not subject to anomalies such as that of Brock and Ackerman.

Modeling Serializability via Process Equivalence in Petri Nets

- Computer Science
- 1992

In the paper a transaction system is modeled by a condition/event Petri net, in which the events of the net are the operations of the transactions and the conditions correspond to the objects, while each schedule corresponds to a firing sequence of theNet.

A fully abstract trace model for dataflow networks

- Computer SciencePOPL '89
- 1989

A compositional model for nondeterministic networks is presented, which is fully abstract, i.e., it has added the least amount of extra information to Kahn's model which is necessary for attaining compositionality.

Axiomatizing net computations and processes

- Mathematics[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
- 1989

The diamond of the four categories gives a full account in algebraic terms of the relations between interleaving and partial ordering observations of place/transition net computations, providing a most concrete and a most abstract extremum, respectively.

Isomorphisms Between Petr Nets and Dataflow Graphs

- Computer ScienceIEEE Transactions on Software Engineering
- 1987

It is demonstrated that, in principle, it is possible to determine aspects of the overall behavior from the particular behavior of components in dataflow graphs.

A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks

- Computer Science
- 1990

This paper gives a simple, direct generalization of Kahn’s fixed-point principle to a large class of indeterminate dataflow networks, and sketches a proof that results obtained by the generalized principle are in agreement with a natural operational semantics.

The Semantics of a Simple Language for Parallel Programming

- Computer ScienceIFIP Congress
- 1974

A simple language for parallel programming is described and its mathematical properties are studied to make a case for more formal languages for systems programming and the design of operating systems.

Petri Nets: An Introduction

- Computer ScienceEATCS Monographs on Theoretical Computer Science
- 1985

The author presents an example for Applying S-Invariants: The Verification of Facts in C/E-Systems by Means of S- Invariants, a model based on the successful implementation of Nets Analysis in the context of Logic Circuits and Operating Systems.

Nets of processes and data flow

- Computer ScienceREX Workshop
- 1988

Nets of Processes provide a unifying approach to semantics of concurrently executing agents and modularity and Kahn's principle are investigated for Data Flow Networks.