P/T-Nets with the Step Firing Rule

Abstract

In this chapter, P/T-nets are given a concurrent semantics by replacing the usual firing rule with the step firing rule, which allows steps M[e>M’ where e is a multiset of transitions. Concurrent reachability graphs of P/T-nets are a particular case of Mukund’s step transition systems. After reformulating Mukund’s definition of regions in step transition systems, we examine the P/T-net realization problem for step transition systems and for step languages. As an aside, we present two extended forms of the P/T-net realization problem for step transition systems, and an alternative form of the P/T-net realization problem for partially ordered languages.