Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131)
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: Decidable verification for reducible timed automata specified in a first order logic with time |
scientific article; zbMATH DE number 1774104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidable verification for reducible timed automata specified in a first order logic with time |
scientific article; zbMATH DE number 1774104 |
Statements
Decidable verification for reducible timed automata specified in a first order logic with time (English)
0 references
31 July 2002
0 references
timed automata
0 references
verification
0 references
first-order logic
0 references
decidable class
0 references
0 references
0 references
0.9063264
0 references
0.9042827
0 references
0.8967413
0 references
0.8956551
0 references
0.8928341
0 references
0.8897136
0 references
0.8855236
0 references
