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...

Description complète

Détails bibliographiques
Auteurs principaux: Haase, C, Ouaknine, J, Worrell, J
Format: Journal article
Langue:English
Publié: 2012