Unfolding for Time Petri Net

作者:Benito F C V*; Kunzle L A
来源:IEEE Latin America Transactions, 2017, 15(5): 1001-1008.
DOI:10.1109/tla.2017.7912599

摘要

Time analysis tools for Time Petri nets, as State Class Graph, although very useful, face the problem of combinatorial explosion of the number of states. This becomes intractable especially in large Petri nets, when real systems are modeled, usually with a high degree of parallelism and concurrency. In ordinary Petri nets (not timed), unfolding technique can overcome the state explosion problem. It is also permits to identify all accessible states and all transitions firing sequences. However, the direct application of the unfolding process, in Time Petri nets, generates invalid classes and suppresses other valid ones. This article proposes a new unfolding procedure, for Time nets, in which time constraints are taken into account. This new procedure, called "time unfolding", generates a new occurrence net, in which all states classes and transitions firing sequences are preserved, without enumerating the whole state space.

  • 出版日期2017-5

全文