Learn More
This paper focuses on the problem of computing a reachable upper bound for the throughput of transitions in live and safe free choice nets. Starting from the consideration that a live a safe free choice net can be viewed as an interconnection of live and safe marked graphs, previous results on the throughput upper bound computation for marked graphs are(More)
In this paper, the forbidden state problem, in the context of supervisory control of discrete event systems modelled by Petri nets, is discussed. The forbidden state problem is specified by generalized mutual exclusion constraints (GMECs). The case of backward conflict free and free choice uncontrollable subnet is considered. The uncontrollable subnet is(More)
Extended abstract In this work a new model for urban traffic control is proposed. The main aim in urban traffic control is to maximize the throughput of the system by means of real-time actions [1]. One can, for example, maximize network throughput by dynamically adapting the signal timings in response to changing traffic demand and by coordinating the(More)
  • 1