Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete (Q6614617)
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: Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete |
scientific article; zbMATH DE number 7922397
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete |
scientific article; zbMATH DE number 7922397 |
Statements
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete (English)
0 references
7 October 2024
0 references
parametric timed automata
0 references
computational complexity
0 references
reachability
0 references
\textsf{EXPSPACE}-complete
0 references
0 references
