Abstract

This paper presents a traffic controller modeled with Controlled state machine Petri nets to avoid temporary forbidden states. From the introduction of the forbidden states avoidance problem, forbidden states have been treated as a finite set of places with a specific marking. We divide the set of forbidden states in two, and introduce a new class with a temporary existence to represent more faithfully the behavior of some systems; the set of temporary forbidden states changes with the time, increasing and decreasing at a maximum and minimum size. The main problem we tackle is how to construct the traffic controller to restrict the behavior of the plant and avoid any class of forbidden states. A secondary problem is to reduce the size of the vectors of admissible control by using a smaller number of control places. At the end we present the model of the traffic controller and the simulation results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call