Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals

Among discrete event systems, those exhibiting concurrency are especially challenging, requiring the use of formal methods to deal with them. Petri nets are a well-established such formalism. The structure theory aims at overcoming the state space explosion problem, inherent to the analysis of concurrent systems, by bridging structural and behavioral properties. To date, this has been successfully achieved mainly for some subclasses of ordinary nets. However weights are a modeling convenience in many situations. In this paper we study a formal model for a subclass of concurrent systems with bulk services and arrivals which structurally avoids conflicts. Structural results and techniques for dealing with them are introduced. These include structural conditions on properties of correct behavior and a unified framework for checking general behavioral properties by reasoning solely on the structure