Keeping a crowd safe: on the complexity of parameterized verification (invited talk) (Q2965467)
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 6691385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Keeping a crowd safe: on the complexity of parameterized verification (invited talk) |
scientific article; zbMATH DE number 6691385 |
Statements
3 March 2017
0 references
parameterized verification
0 references
automata theory
0 references
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). (English)
0 references
0.7901299595832825
0 references
0.781268298625946
0 references
0.7744051814079285
0 references
0.7722491025924683
0 references
