A Petri nets semantics for data flow networks

  title={A Petri nets semantics for data flow networks},
  author={C. Bernardeschi and N. D. Francesco and G. Vaglini},
  journal={Acta Informatica},
  • C. Bernardeschi, N. D. Francesco, G. Vaglini
  • Published 2005
  • Computer Science
  • Acta Informatica
  • 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… CONTINUE READING
    1 Citations

    Figures, Tables, and Topics from this paper

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


    A Fully Abstract Semantics for Data Flow Nets
    • J. Kok
    • Computer Science
    • PARLE
    • 1987
    • 69
    • PDF
    A fixpoint semantics for nondeterministic data flow
    • 45
    Modeling Serializability via Process Equivalence in Petri Nets
    • 4
    • PDF
    A fully abstract trace model for dataflow networks
    • 93
    • Highly Influential
    The Non-sequential Behavior of Petri Nets
    • 275
    • Highly Influential
    Axiomatizing net computations and processes
    • 112
    • PDF
    A straightforward denotational semantics for non-determinate data flow programs
    • 44
    Isomorphisms Between Petr Nets and Dataflow Graphs
    • 54
    • PDF
    A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks
    • 19
    The Semantics of a Simple Language for Parallel Programming
    • G. Kahn
    • Computer Science
    • IFIP Congress
    • 1974
    • 2,567
    • PDF