A symbolic approach for maximally permissive deadlock avoidance in complex resource allocation systems

To develop an efficient implementation of the maximally permissive deadlock avoidance policy (DAP) for complex resource allocation systems (RAS), a recent approach focuses on the identification of a set of critical states of the underlying RAS state-space, referred to as minimal boundary unsafe states. The availability of this information enables an expedient one-step-lookahead scheme that prevents the RAS from reaching outside its safe region. This paper presents a symbolic approach that provides those critical states. Furthermore, by taking advantage of certain structural properties regarding RAS safety, the presented method avoids the complete exploration of the underlying RAS state-space. Numerical experimentation demonstrates the efficiency of the approach for developing the maximally permissive DAP for complex RAS with large structure and state-spaces, and its potential advantage over similar approaches that employ more conventional representational and computational methods

Supplement for the paper entitled “A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems”

This electronic document provides some supportive material to the paper entitled “A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems” that has been submitted to IEEE Transactions on Automation Science and Engineering (T-ASE)

Congestion avoidance in city traffic

The number of vehicles on the road (worldwide) is constantly increasing, causing traffic jams and congestion especially in city traffic. Anticipatory vehicle routing techniques have thus far been applied to fairly small networked traffic scenarios and uniform traffic. We note here a number of limitations of these techniques and present a routing strategy on the assumption of a city map that has a large number of nodes and connectivity and where the vehicles possess highly varying speed capabilities. A scenario of operation with such characteristics has not previously been sufficiently studied in the literature. Frequent short-term planning is preferred as compared with infrequent planning of the complete map. Experimental results show an efficiency boost when single-lane overtaking is allowed, traffic signals are accounted for and every vehicle prefers to avoid high traffic density on a road by taking an alternative route. Comparisons with optimistic routing, pessimistic routing and time message channel routing are given Publisher statement: This is the peer reviewed version of the following article: Kala, Rahul and Warwick, K. (2015) Congestion avoidance in city traffic. Journal of Advanced Transportation, volume 49 (4): 581–595, which has been published in final form at http://dx.doi.org/10.1002/atr.1290. This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving (http://olabout.wiley.com/WileyCDA/Section/id-820227.html#terms)

Guest Editorial: Special Section on Advances in Discrete-Event Systems for Automation

n/