Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Verification of Nonblockingness in Bounded Petri Nets With Minimax Basis
  Reachability Graphs   This paper proposes a semi-structural approach to verify the nonblockingness
of a Petri net. We construct a structure, called minimax basis reachability
graph (minimax-BRG): it provides an abstract description of the reachability
set of a net while preserving all information needed to test if the net is
blocking. We prove that a bounded deadlock-free Petri net is nonblocking if and
only if its minimax-BRG is unobstructed, which can be verified by solving a set
of integer constraints and then examining the minimax-BRG. For Petri nets that
are not deadlock-free, one needs to determine the set of deadlock markings.
This can be done with an approach based on the computation of maximal implicit
firing sequences enabled by the markings in the minimax-BRG. The approach we
developed does not require the construction of the reachability graph and has
wide applicability.

31
The categories of this paper are: ao-sci
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat