On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions (Q3384161)
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: On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions |
scientific article |
Statements
14 December 2021
0 references
0 references
0 references
0.953722357749939
0 references
0.8831576704978943
0 references
0.8713172078132629
0 references
0.8549758195877075
0 references
0.8498581051826477
0 references
