KReach: A Tool for Reachability in Petri Nets

Dixon, Alex; Lazić, Ranko

doi:10.1007/978-3-030-45190-5_22

Cited by 13 publications

(9 citation statements)

References 23 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, the other heuristics perform strictly worse on almost all instances. We also considered comparing with KReach [17], a tool showcased at TACAS'20 that implements an exact non-elementary algorithm. However, it timed out on all instances with a larger time limit of 10 minutes.…”

Section: Resultsmentioning

confidence: 99%

Directed Reachability for Infinite-State Systems

Blondin

Haase

Offtermatt

2021

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%

Directed Reachability for Infinite-State Systems

Blondin

Haase

Offtermatt

2021

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…It is in fact a feat that this algorithm has been implemented at all, see e.g. the tool KReach [15]. While the (very high) complexity of the problem means that no single algorithm could work efficiently on all inputs, it does not prevent the existence of methods that work well on some classes of problems.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

“…Reachability for Petri nets is an important and difficult problem with many practical applications: obviously for the formal verification of concurrent systems, but also for the study of diverse types of protocols (such as biological or business processes); the verification of software systems; the analysis of infinite state systems; etc. It is also a timely subject, as shown by recent publications on this subject [7,15], but also with the recent progress made on settling its theoretical complexity [12,13], which asserts that reachability is Ackermann-complete, and therefore inherently more complex than, say, the coverability problem. A practical consequence of this "inherent complexity", and a general consensus, is that we should not expect to find a one-size-fits-all algorithm that could be usable in practice.…”

Section: Introductionmentioning

confidence: 99%

Property Directed Reachability for Generalized Petri Nets

Amat

Zilio

Hujsa

2022

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

We propose a semi-decision procedure for checking generalized reachability properties, on generalized Petri nets, that is based on the Property Directed Reachability (PDR) method. We actually define three different versions, that vary depending on the method used for abstracting possible witnesses, and that are able to handle problems of increasing difficulty. We have implemented our methods in a model-checker called SMPT and give empirical evidences that our approach can handle problems that are difficult or impossible to check with current state of the art tools.

show abstract

“…In general the complexity of the reachability problem in low dimensional VASSes still has a lot of question marks. For each d ∈ [3,7] we do not know whether it is elementary or not, moreover for d ∈ [3,5] for binary encoding we still cannot exclude that the problem is PSpace-complete, exactly like for 2-VASSes [1]. In order to exclude PSpace-completeness it would be helpful to come up with some say ExpSpace-hard or ExpTime-hard problem, which does not involve bounded counter automata but is anyway convenient for a hardness proof; similarly as Subset Sum is convenient for NP-hardness proof for unary flat 4-VASSes.…”

Section: Future Researchmentioning

confidence: 99%

“…Therefore it is quite possible that the search for exact complexity bounds for the reachability problem in low dimensions will result in finding new techniques useful in much broader generality. Thirdly, despite very high pessimistic complexity of the reachability problem it still can be solved in practise in many cases [5]. Therefore it is not only a theoretical, but may be also of practical interest to understand for which VASS subclasses the reachability problem have relatively low complexity and avoiding which obstacles may lead to efficient algorithms.…”

Section: Introductionmentioning

confidence: 99%