Numerical P Systems with Thresholds and Petri Nets

Membrane computing provides efficient computing devices for broad applications due to its distributed storage and the parallel processing. As computing devices in membrane computing, numerical P systems with thresholds (NPT systems) are proven to be Turing universal, and their computational and operational semantics need to be further investigated. In this work, the intrinsic relationship between NPT systems and Petri nets is concerned. The ingredients of Petri nets are associated with the elements of numerical variables in NPT systems, and the operations of Petri nets are associated with the evolutions of NPT systems. The results on the boundedness and reachability of NPT systems are obtained by using the relationship between NPT systems and Petri nets.