Petri Net-Based Verification of Adaptive Traffic Light Control with AIMD Algorithm

Simple item page
dc.contributor.authorPrasanna, S.
dc.contributor.authorGulati, A.
dc.contributor.authorAnagha, H.C.
dc.contributor.authorPrabhu, A.
dc.contributor.authorDas, M.
dc.contributor.authorMohan, B.R.
dc.date.accessioned2026-02-06T06:34:08Z
dc.date.issued2024
dc.description.abstractThis paper introduces and analyses the performance of the Petri net model created to simulate a traffic control system using the Additive Increase Multiplicative Decrease (AIMD) algorithm. The Petri net model was designed using TimeNET [1] tool. The model was evaluated by analysing the Reachability Graph generated by a Depth First Search (DFS) and Backtracking based algorithm. Several criteria such as Stability, Boundedness, Deadlock, etc. were verified by our proposed algorithm. The model was then validated through a C++ code to ensure it performs correctly under different situations. All the related code, images, and tables used in this paper can be found at GitHub 1 © 2024 IEEE.
dc.identifier.citation2024 IEEE International Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation, IATMSI 2024, 2024, Vol., , p. -
dc.identifier.urihttps://doi.org/10.1109/IATMSI60426.2024.10502455
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/29076
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectBoundedness
dc.subjectDeadlock
dc.subjectDepth First Search
dc.subjectPetri Net
dc.subjectReachability Graph
dc.subjectSimulation
dc.titlePetri Net-Based Verification of Adaptive Traffic Light Control with AIMD Algorithm

Files

Collections

Conference Papers