Executions: A new partial-order semantics of Petri nets (Q1183595)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Executions: A new partial-order semantics of Petri nets |
scientific article; zbMATH DE number 33412
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Executions: A new partial-order semantics of Petri nets |
scientific article; zbMATH DE number 33412 |
Statements
Executions: A new partial-order semantics of Petri nets (English)
0 references
28 June 1992
0 references
Executions are a generalization of the processes of safe Petri nets. The idea is to view places as shared variables, the conditions holding during a system run do not correspond to single tokens as in processes but to a number of tokens lying on one place at some stage. It turns out that executions of general \(P/T\) nets define equivalence classes on the occurrence sequences as the processes of safe nets do. Various relations between executions and processes are established and analyzed.
0 references
partial order semantics
0 references
concurrency
0 references
Petri nets
0 references