Reachability in two-clock timed automata is PSPACE-complete (Q2347796)
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-clock timed automata is PSPACE-complete |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability in two-clock timed automata is PSPACE-complete |
scientific article |
Statements
Reachability in two-clock timed automata is PSPACE-complete (English)
0 references
9 June 2015
0 references
timed automata
0 references
counter automata
0 references
PSPACE-complete
0 references
