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 the normal view instead:
scientific article; zbMATH DE number 6443997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability in two-clock timed automata is PSPACE-complete |
scientific article; zbMATH DE number 6443997 |
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
0.9999998
0 references
0.87875795
0 references
0.8582197
0 references
0 references
