The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (Q2986811)
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: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets |
scientific article |
Statements
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (English)
0 references
16 May 2017
0 references
complexity theory
0 references
fast-growing hierarchy
0 references
formal verification
0 references
Petri nets
0 references
well-structured systems
0 references
