Non-Blockingness Verification of Bounded Petri Nets Using Basis Reachability Graphs -- An Extended Version With Benchmarks

TL;DR

This paper introduces an efficient method for verifying non-blockingness in bounded Petri nets using basis reachability graphs, avoiding exhaustive state space enumeration and applicable even if the net can deadlock.

Contribution

It develops a transition partition condition ensuring the conflict-increase basis reachability graph suffices for non-blockingness verification, enhancing practical efficiency.

Findings

The method avoids exhaustive state enumeration.

It works for nets that may deadlock.

It is validated with benchmark examples.

Abstract

In this paper, we study the problem of non-blockingness verification by tapping into the basis reachability graph (BRG). Non-blockingness is a property that ensures that all pre-specified tasks can be completed, which is a mandatory requirement during the system design stage. In this paper we develop a condition of transition partition of a given net such that the corresponding conflict-increase BRG contains sufficient information on verifying non-blockingness of its corresponding Petri net. Thanks to the compactness of the BRG, our approach possesses practical efficiency since the exhaustive enumeration of the state space can be avoided. In particular, our method does not require that the net is deadlock-free.