Reachability in two-clock timed automata is PSPACE-complete (Q5327435)
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; zbMATH DE number 6196333
| 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 6196333 |
Statements
Reachability in Two-Clock Timed Automata Is PSPACE-Complete (English)
0 references
7 August 2013
0 references
0.9967406392097472
0 references
0.8625420928001404
0 references
0.8499197959899902
0 references
0.8150383234024048
0 references
0.7858835458755493
0 references
