Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174)
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: Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable |
scientific article; zbMATH DE number 7493580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable |
scientific article; zbMATH DE number 7493580 |
Statements
Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (English)
0 references
21 March 2022
0 references
0.8050748109817505
0 references
0.7983931303024292
0 references
0.7951851487159729
0 references
0.7883850336074829
0 references
0.7855232954025269
0 references
