Deadlock-free verification of RosettaNet PIPs with time Petri nets

This paper deals with the verification problem of RosettaNet. The RosettaNet PIPs specifications are first modelled with time Petri nets (TPNs) which allow an explicit modelling of concurrency and parallelism. We demonstrate that RosettaNet PIPs are deadlock-free in both the deterministic and stochastic operational environments. A patch subnet technique is developed to improve the efficiency of RosettaNet PIPs. We also suggest to remove some steps defined in RosettaNet PIPs that are proved to never take place.