A. Tarek (USA)
Petri Nets, Dynamic Programming, Task Sequence.
Petri nets (PNs) are a graphical and mathematical modelling tool for the formal analysis of systems. Here systems include discrete event dynamic systems that are characterized as being concurrent, asynchronous, distributed, parallel, and/or nondeterministic. Reach ability is fundamental to the analysis of PNs. A Linear Programming (LP) method with pseudo-polynomial time complexity is reported in [23]. However, one dis advantage of the proposed method in [23] is that the size of constraints and the number of variables become enormous as the size of the problem increases. To ad dress this problem, a Dynamic Programming (DP) based method is proposed in [1]. This method de pends on combinations of transitions to compute an optimal firing sequence (OFS) of the PN reachability problem. Applications of the proposed method in busi ness process modelling and analysis are also consid ered. Specifically, the proposed method has potential for applying to the organizational analysis of financial accounting systems in business process management.
Important Links:
Go Back
