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...
主要な著者: | Haase, C, Ouaknine, J, Worrell, J |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
2012
|
類似資料
-
On the Relationship between Reachability Problems in Timed and Counter Automata
著者:: Haase, C, 等
出版事項: (2012) -
Reachability in Succinct and Parametric One−Counter Automata
著者:: Haase, C, 等
出版事項: (2009) -
Reachability in Succinct and Parametric One-Counter Automata
著者:: Haase, C, 等
出版事項: (2009) -
On reachability for hybrid automata over bounded time
著者:: Brihaye, T, 等
出版事項: (2011) -
Branching-time model checking of parametric one-counter automata
著者:: Göller, S, 等
出版事項: (2012)