The tractability of model checking for LTL: the good, the bad, and the ugly fragments (Q2946630)
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 6483138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The tractability of model checking for LTL: the good, the bad, and the ugly fragments |
scientific article; zbMATH DE number 6483138 |
Statements
The tractability of model checking for LTL (English)
0 references
17 September 2015
0 references
computational complexity
0 references
Post's lattice
0 references
linear temporal logic
0 references
model checking
0 references
0.9832603931427002
0 references
0.8376652598381042
0 references
0.8376650810241699
0 references
0.8371464610099792
0 references
