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

全面介绍

书目详细资料
Main Authors: Blondin, M, Haase, CJ, Offtermatt, P
格式: Conference item
语言:English
出版: Springer 2021