On the decidability and complexity of Metric Temporal Logic over finite words (Q5310684)
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 5200154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the decidability and complexity of Metric Temporal Logic over finite words |
scientific article; zbMATH DE number 5200154 |
Statements
On the decidability and complexity of Metric Temporal Logic over finite words (English)
0 references
11 October 2007
0 references
0.9529737
0 references
0.93662846
0 references
0.9229951
0 references
0.92271495
0 references
0.92039424
0 references
0.92039424
0 references
0.90993005
0 references
0.9094599
0 references
