Some complexity results for stateful network verification (Q2335903)
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 7130923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some complexity results for stateful network verification |
scientific article; zbMATH DE number 7130923 |
Statements
Some complexity results for stateful network verification (English)
0 references
18 November 2019
0 references
safety verification
0 references
stateful networks
0 references
middleboxes
0 references
channel systems
0 references
Petri nets
0 references
complexity bounds
0 references
0 references
0.7077383995056152
0 references
0.6910965442657471
0 references
0.6806806921958923
0 references
0.6791966557502747
0 references
