Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6949501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded choice-free Petri net synthesis: algorithmic issues |
scientific article; zbMATH DE number 6949501 |
Statements
Bounded choice-free Petri net synthesis: algorithmic issues (English)
0 references
9 October 2018
0 references
0.9710075855255128
0 references
0.8715534210205078
0 references
0.8713657259941101
0 references
0.8634700179100037
0 references
0.8581569790840149
0 references
