Completeness results for single-path Petri nets (Q690244)
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: Completeness results for single-path Petri nets |
scientific article; zbMATH DE number 447116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness results for single-path Petri nets |
scientific article; zbMATH DE number 447116 |
Statements
Completeness results for single-path Petri nets (English)
0 references
6 May 1994
0 references
A new subclass of persistent Petri nets, called single-path Petri nets, is introduced and some of its basic properties are studied. Each of these nets is an (ordinary) Petri net with only one complete path (i.e., which cannot be extended) in it. The paper contains interesting ideas in the frames of Petri net theory.
0 references
persistent Petri nets
0 references
0.9042394
0 references
0.8946318
0 references
0 references
0.8878588
0 references
0 references
0.8792423
0 references
