Reachability in two-clock timed automata is PSPACE-Complete

Authors:
John Fearnley;Marcin Jurdziński
Affiliations:
Department of Computer Science, University of Liverpool, UK;Department of Computer Science, University of Warwick, UK
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 6
Cited 0

Minimum and maximum delay problems in real-time systems

Formal Methods in System Design - Special issue on computer-aided verification: special methods I
A theory of timed automata

Theoretical Computer Science
The complexity of membership problems for circuits over sets of integers

Theoretical Computer Science
Infinite Runs in Weighted Timed Automata with Energy Constraints

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Reachability in Succinct and Parametric One-Counter Automata

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the relationship between reachability problems in timed and counter automata

RP'12 Proceedings of the 6th international conference on Reachability Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Haase, Ouaknine, and Worrell have shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. We show that reachability in bounded one-counter automata is PSPACE-complete.