scientific article; zbMATH DE number 18633

DOI10.1007/BFB0029623MaRDI QIDQ3976036zbMATH OpenFDO

Authors Robert Gold, Walter Vogler

Publication date 26 June 1992

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0029623

zbMATH Keywords

partial order semanticsplace/transition nets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

[For the entire collection see Zbl 0731.00026.] Various properties of partial order semantics for place/transition nets as: unifomity, consistency, prefix-closeness, compositionality and completion-invariant are defined and analyzed. A semantics which has all the above properties is called well-behaved. An example of a well-behaved semantics, called flow, is given.

Recommendations

• scientific article; zbMATH DE number 149517
• On the semantics of place/transition nets
• Partial order behaviour and structure of Petri nets
• Dataflow semantics for Petri nets
• Partial Order Semantics of Types of Nets

Cited in

(2)

• Partial Order Semantics of Types of Nets
• scientific article; zbMATH DE number 149517 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976036)