Deadlock-free verification and performance enhancement of RosettaNet PIPs with time Petri nets

This paper deals with the deadlock-free verification problem of RosettaNet, a promising and widespread e-business protocol in the information technology and electronic industries. RosettaNet PIPs (partner interface processes) specifications are first modelled with time Petri nets (TPNs) which allow an explicit modelling of concurrency and parallelism. Correctness of the TPN models is verified to ensure the capability of deadlock-freeness, auto-repairing implementation of RosettaNet applications. We adopt the idea of checking the possible existence of an uncontrolled siphon as our deadlock detection mechanism. We demonstrate that RosettaNet PIPs are deadlock-free in both deterministic and stochastic operational environments. A patch subnet technique is developed to improve the efficiency of RosettaNet PIPs. We also prove that the execution of some steps defined in RosettaNet PIPs will never take place. We therefore suggest to removing these unnecessary steps from RosettaNet PIPs and from a lean model.

[1]  A. Gurel,et al.  Analysis of deadlocks and circular waits using a matrix model for discrete event systems , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[2]  Erwin R. Boer,et al.  Generating basis siphons and traps of Petri nets using the sign incidence matrix , 1994 .

[3]  MengChu Zhou,et al.  Petri nets and industrial applications: A tutorial , 1994, IEEE Trans. Ind. Electron..

[4]  Jerry Zeyu Gao,et al.  Automatic generation and integration of RosettaNet based on generic templates and components , 2002, Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002).

[5]  Jeffrey J. P. Tsai,et al.  Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications , 1995, IEEE Trans. Software Eng..

[6]  MengChu Zhou,et al.  Modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems: A Petri net approach , 1998 .

[7]  Tommaso Costa,et al.  Flexible B2B processes: the answer is in the nodes , 2003, Inf. Softw. Technol..

[8]  Yi Deng,et al.  Incremental modeling and verification of flexible manufacturing systems , 1999, J. Intell. Manuf..

[9]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[10]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[11]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[12]  Ference Belik.  An Efficient Deadlock Avoidance Rechnique , 1990, IEEE Trans. Computers.

[13]  Keisuke Yano,et al.  Collaboration Management Framework for integrating B-to-B and internal processes , 2002, Proceedings. Sixth International Enterprise Distributed Object Computing.

[14]  Enrico Vicario,et al.  Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets , 1995, IEEE Trans. Software Eng..

[15]  Kamel Barkaoui,et al.  Deadlock avoidance in FMS based on structural theory of Petri nets , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[16]  James L. Peterson,et al.  Petri net theory and the modeling of systems , 1981 .