Non-Blockingness Verification of Bounded Petri Nets Using Basis Reachability Graphs
Gu C.First
;Ma Z.Second
;Li Z.
;Giua A.Last
2022-01-01
Abstract
In this letter, 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. 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.File | Size | Format | |
---|---|---|---|
22lcss_b.pdf Solo gestori archivio
Description: articolo online
Type: versione editoriale
Size 554.01 kB
Format Adobe PDF
|
554.01 kB | Adobe PDF | & nbsp; View / Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.