Net processes correspond to derivation processes in graph grammars (Q1085621)
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: Net processes correspond to derivation processes in graph grammars |
scientific article; zbMATH DE number 3982542
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Net processes correspond to derivation processes in graph grammars |
scientific article; zbMATH DE number 3982542 |
Statements
Net processes correspond to derivation processes in graph grammars (English)
0 references
1986
0 references
The authors take Petri nets and graph grammars into consideration and prove an equivalence of their behaviours (the existence of simulations in both directions).
0 references
net processes
0 references
non-sequential behaviour
0 references
conflict-free processes
0 references
Petri nets
0 references
graph grammars
0 references
simulations
0 references
