"Reachability in two-clock timed automata is PSPACE-complete."

John Fearnley, Marcin Jurdzinski (2015)

> Home

Details and statistics

DOI: 10.1016/J.IC.2014.12.004

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/FearnleyJ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/FearnleyJ15
John Fearnley, Marcin Jurdzinski:
Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. 243: 26-36 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.