Superposition as a Decision Procedure for Timed Automata

Fietzke, Arnaud Luc; Weidenbach, Christoph

doi:10.1007/s11786-012-0134-5

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Superposition as a Decision Procedure for Timed Automata

MPS-Authors

/persons/resource/persons44415

Fietzke, Arnaud Luc
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Fietzke, A. L., & Weidenbach, C. (2013). Superposition as a Decision Procedure for Timed Automata. Mathematics in Computer Science, 6(4), 409-425. doi:10.1007/s11786-012-0134-5.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-B7C8-A

要旨

The success of superposition-based theorem proving in first-order logic relies in particular on the fact that the superposition calculus can be turned into a decision procedure for various decidable fragments of first-order logic and has been successfully used to identify new decidable classes. In this paper, we extend this story to the hierarchic combination of linear arithmetic and first-order superposition. We show that decidability of reachability in timed automata can be obtained by instantiation of an abstract termination result for SUP(LA), the hierarchic combination of linear arithmetic and first-order superposition.