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
|
Sandhya Avasthi, Tanushree Sanwal, Shivani Sharma, Shweta Roy.
© 2023.
23 pages.
|
|
Subha Karumban, Shouvik Sanyal, Madan Mohan Laddunuri, Vijayan Dhanasingh Sivalinga, Vidhya Shanmugam, Vijay Bose, Mahesh B. N., Ramakrishna Narasimhaiah, Dhanabalan Thangam, Satheesh Pandian Murugan.
© 2023.
17 pages.
|
|
Aditya Saxena, Devansh Chauhan, Shilpi Sharma.
© 2023.
26 pages.
|
|
Eduardo José Villegas-Jaramillo, Mauricio Orozco-Alzate.
© 2023.
33 pages.
|
|
Revathi A., Poonguzhali S..
© 2023.
18 pages.
|
|
Indu Malik, Anurag Singh Baghel.
© 2023.
18 pages.
|
|
Shanu Sharma, Tushar Chand Kapoor, Misha Kakkar, Rishi Kumar.
© 2023.
24 pages.
|
|
|