The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Composition of Functional Petri Nets
Abstract
Functional Petri nets and subnets are introduced and studied for the purpose of speed-up of Petri nets analysis with algebraic methods. The authors show that any functional subnet may be generated by a composition of minimal functional subnets. They propose two ways to decompose a Petri net: via logical equations solution and with an ad-hoc algorithm, whose complexity is polynomial. Then properties of functional subnets are studied. The authors show that linear invariants of a Petri net may be computed from invariants of its functional subnets; similar results also hold for the fundamental equation of Petri nets. A technique for Petri nets analysis using composition of functional subnets is also introduced and studied. The authors show that composition-based calculation of invariants and solutions of fundamental equation provides a significant speed-up of computations. For an additional speed-up, they propose a sequential composition of functional subnets. Sequential composition is formalised in the terms of graph theory and was named the optimal collapse of a weighted graph. At last, the authors apply the introduced technique to the analysis of Petri net models of such well-known networking protocols as ECMA, TCP, BGP.
Related Content
Tanima Sahoo, Arijit Mondal, Piyal Roy, Amitava Podder.
© 2024.
20 pages.
|
Hüseyin Fatih Çetinkaya, Ali Fazıl Yenidünya, Serap Çetinkaya, Burak Tüzün.
© 2024.
15 pages.
|
Digvijay Pandey, Vinay Kumar Nassa, Binay Kumar Pandey, Blessy Thankachan, Pankaj Dadheech, Darshan A Mahajan, A. Shaji George.
© 2024.
22 pages.
|
Loutfy H. Madkour.
© 2024.
38 pages.
|
Loutfy H. Madkour.
© 2024.
50 pages.
|
Rita Komalasari.
© 2024.
25 pages.
|
Aakifa Shahul, Balakumar Muniandi, Mukundan Appadurai Paramashivan, Digvijay Pandey, Binay Kumar Pandey, Pankaj Dadheech, Hovan George.
© 2024.
14 pages.
|
|
|