Parametric runtime verification is NP-complete and coNP-complete (Q522961)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parametric runtime verification is NP-complete and coNP-complete |
scientific article |
Statements
Parametric runtime verification is NP-complete and coNP-complete (English)
0 references
20 April 2017
0 references
runtime monitoring
0 references
computational complexity
0 references
formal languages
0 references
parametric words
0 references
membership problems
0 references
