A logical characterization of timed regular languages (Q728264)
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: A logical characterization of timed regular languages |
scientific article; zbMATH DE number 6666066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A logical characterization of timed regular languages |
scientific article; zbMATH DE number 6666066 |
Statements
A logical characterization of timed regular languages (English)
0 references
19 December 2016
0 references
timed automata
0 references
dense-time temporal logic
0 references
constraint linear temporal logic
0 references
0.9699143171310424
0 references
0.8432081341743469
0 references
0.8204817175865173
0 references
0.7894546985626221
0 references