Directed reachability for infinite-state systems

Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary time, which raises questions about the practical applicabili...

詳細記述

書誌詳細
主要な著者: Blondin, M, Haase, CJ, Offtermatt, P
フォーマット: Conference item
言語:English
出版事項: Springer 2021

類似資料