On the relationship between reachability problems in timed and counter automata

Authors:
Christoph Haase;Joël Ouaknine;James Worrell
Affiliations:
Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK
Venue:
RP'12 Proceedings of the 6th international conference on Reachability Problems
Year:
2012

Citing 6
Cited 1

Parametric real-time reasoning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Linear Algebra in Net Theory

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
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

Reachability in two-clock timed automata is PSPACE-Complete

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper establishes a relationship between reachability problems in timed automata and space-bounded counter automata. We show that reachability in timed automata with three or more clocks is naturally logarithmic-space interreducible with reachability in space-bounded counter automata with two counters. We moreover show the logarithmic-space equivalence of reachability in two-clock timed automata and space-bounded one-counter automata. This last reduction provides new insight into two problems whose precise computational complexity have independently been identified as open.