On the relationship between reachability problems in timed and counter automata
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 c...
| Auteurs principaux: | , , |
|---|---|
| Format: | Journal article |
| Langue: | English |
| Publié: |
2012
|
Documents similaires
Reachability in Succinct and Parametric One−Counter Automata
par: Haase, C, et autres
Publié: (2009)
par: Haase, C, et autres
Publié: (2009)