What's decidable about parametric timed automata? (Q4686606)
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 6946588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What's decidable about parametric timed automata? |
scientific article; zbMATH DE number 6946588 |
Statements
What’s Decidable About Parametric Timed Automata? (English)
0 references
2 October 2018
0 references
0 references
0.8606492280960083
0 references
0.8526691794395447
0 references
0.847700297832489
0 references
0.8366686105728149
0 references
0.8358533382415771
0 references
