Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs (Q1708655)
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: Plain, bounded, reversible, persistent, and k-marked Petri nets have marked graph reachability graphs |
scientific article; zbMATH DE number 6852687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs |
scientific article; zbMATH DE number 6852687 |
Statements
Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs (English)
0 references
26 March 2018
0 references
0.8599942922592163
0 references
0.8407610654830933
0 references
0.8291399478912354
0 references
0.8028119802474976
0 references
0.7993194460868835
0 references
