Reachability in Two-Clock Timed Automata Is PSPACE-Complete (Q5327435)
From MaRDI portal
scientific article; zbMATH DE number 6196333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability in Two-Clock Timed Automata Is PSPACE-Complete |
scientific article; zbMATH DE number 6196333 |
Statements
Reachability in Two-Clock Timed Automata Is PSPACE-Complete (English)
0 references
7 August 2013
0 references
