Reachability Problem ofMarkedGraphs withBatchProcessing Arcs

Petri netisamathematical modelfordiscrete event systems. Batchprocessing arcsaresuggested whichmovesall tokens initsinputplaces bysingle firing oftransition. This extension makesPetri netTuring machineequivalent, which meansmostofimportant analysis problems including reachabil- ityproblem areundecidable. Inthis report, westudy reachability problemofmarkedgraphswithbatchprocessing arcs. Itis assumedthattransitions areclassified intwocategories: for eachtransition, either allincident arcsarenormalarcsorall incident arcsarebatchprocessing arcs. Underthis assumption, necessary andsufficient condition forreachability ofmarked graphs without batchprocessing arcsisshowntobeextended to thatwithbatchprocessing arcs.