The complexity of diagnosability and opacity verification for Petri nets (Q1662539)
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 complexity of diagnosability and opacity verification for Petri nets |
scientific article; zbMATH DE number 6920502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of diagnosability and opacity verification for Petri nets |
scientific article; zbMATH DE number 6920502 |
Statements
The complexity of diagnosability and opacity verification for Petri nets (English)
0 references
20 August 2018
0 references
0 references
0.9247812
0 references
0.92077684
0 references
0.9123627
0 references
0.9116868
0 references
0.8968327
0 references
0.89359003
0 references
0.89174974
0 references
