Skip to main content
main-content
Top

Hint

Swipe to navigate through the chapters of this book

Published in:
Cover of the book

Open Access 2021 | OriginalPaper | Chapter

Directed Reachability for Infinite-State Systems

Authors: Michael Blondin, Christoph Haase, Philip Offtermatt

Published in: Tools and Algorithms for the Construction and Analysis of Systems

Publisher: Springer International Publishing

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 applicability of Petri nets as target models. In this paper, we introduce a novel approach for efficiently semi-deciding the reachability problem for Petri nets in practice. Our key insight is that computationally lightweight over-approximations of Petri nets can be used as distance oracles in classical graph exploration algorithms such as $$\mathsf {A}^{*}$$ A ∗ and greedy best-first search. We provide and evaluate a prototype implementation of our approach that outperforms existing state-of-the-art tools, sometimes by orders of magnitude, and which is also competitive with domain-specific tools on benchmarks coming from program synthesis and concurrent program analysis.

download
DOWNLOAD
share
SHARE
print
PRINT
Metadata
Title
Directed Reachability for Infinite-State Systems
Authors
Michael Blondin
Christoph Haase
Philip Offtermatt
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-72013-1_1