Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization of automata-theoretic infinite-state verification from stri...
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Open Publishing Association
2015-09-01
|
| シリーズ: | Electronic Proceedings in Theoretical Computer Science |
| オンライン･アクセス: | http://arxiv.org/pdf/1509.07202v1 |