Petri net is an effective tool for concurrent systems. This paper studies analysis of batch Petri net, which is an extended Petri net with batch processing arcs. Intuitively, if a batch processing arc is connected from a place p to a transition t, then single firing of the transition t removes all tokens in p. In this paper, we show that batch Petri net with unity weighted arcs is Turing machine equivalent. Analysis using incidence matrices is studied to show P-invariant is as effective as in normal Petri net. © 2006 IEEE.