Modeling and Analyzing Project Performance with Timing Constraint Petri Net

Time Petri net and timed Petri net, in which transactions are constrained with time info, are widely used in task scheduling and performance analysis, whereas they are not effective enough for project performance analysis. Timing constraint Petri net (TcPN for short) is proposed in which places are endued with time delaying domain and time persisting domain simultaneously. Furthermore, all time constraints are based on global clock. Colored resource property is attached to backward flow relation for cost evaluation. The formal definition of TcPN and its firing rule are furnished. An algorithm is offered to calculate the time constraint. State class method is used for the cost space analysis. For proving its feasibility in analyzing project performance, an example is provided and variant performance problems (such as critical path, shortest period, cost control,and state space) are discussed.

[1]  Khaled Ghédira,et al.  Reachability search in timed Petri nets using constraint programming , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[2]  François Vernadat,et al.  Abstract State Spaces for Time Petri Nets Analysis , 2008, 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC).

[3]  Philippe Chrétienne,et al.  Timed Petri net schedules , 1987, European Workshop on Applications and Theory of Petri Nets.

[4]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

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

[6]  Vedran Kordic,et al.  Petri Net, Theory and Applications , 2008 .

[7]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[8]  François Vernadat,et al.  State Class Constructions for Branching Analysis of Time Petri Nets , 2003, TACAS.