{"54706":{"#nid":"54706","#data":{"type":"event","title":"Designing compact and maximally permissive liveness-enforcing supervisors for complex resource allocation systems through classi","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETITLE:\u003C\/strong\u003E Designing compact\nand maximally permissive liveness-enforcing supervisors for complex resource\nallocation systems through classification theory\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ESPEAKER:\u003C\/strong\u003E Professor Spiridon Reveliotis\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EABSTRACT:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EThe problem\nof liveness-enforcing supervision -- or, deadlock avoidance -- for complex\nresource allocation systems (RAS) is a well-documented problem in supervisory\ncontrol theory. Most of the past research on it has acknowledged the fact that\nthe maximally permissive liveness-enforcing supervisor (LES) possesses\nsuper-polynomial complexity for most RAS classes, and therefore, it has\nresorted to solutions that trade off maximal permissiveness for computational\ntractability. In the presented work, we distinguish between the\n\u0022off-line\u0022 and the \u0022on-line\u0022 computation that is required\nfor the effective implementation of the maximally permissive LES, and we seek to\ndevelop representations of the maximally permissive LES that require\n\u0022minimal\u0022 on-line computation. \u003Cbr \/\u003E\n\u003Cbr \/\u003E\nThe particular representation that we adopt is that of a compact classifier\nthat will effect the underlying dichotomy of the reachable state space into safe\nand unsafe subspaces. Through a series of reductions of the derived\nclassification problem, we are able to attain extensive reductions in, both,\n(i) the computational complexity of the off-line task of the construction of\nthe sought classifier, and (ii) the complexity involved in the on-line\nclassification process itself. We formally establish completeness and\noptimality properties for the proposed design procedures. We also offer\nheuristics that, if necessary, can alleviate the computational effort that is\nnecessary for the construction of the sought classifier. Finally, we\ndemonstrate the efficacy of the developed approaches through a series of\ncomputational experiments. To the best of our knowledge, these experiments also\nestablish the ability of the proposed methodology to effectively compute\ntractable implementations of the maximally permissive LES for problem instances\nsignificantly beyond the capacity of any other approach currently available in\nthe literature.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EDesigning compact\nand maximally permissive liveness-enforcing supervisors for complex resource\nallocation systems through classification theory\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"Designing compact and maximally permissive liveness-enforcing supervisors for complex resource allocation systems through classification theory"}],"uid":"27187","created_gmt":"2010-03-01 12:04:03","changed_gmt":"2016-10-08 01:50:57","author":"Anita Race","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2010-03-05T11:00:00-05:00","event_time_end":"2010-03-05T12:00:00-05:00","event_time_end_last":"2010-03-05T12:00:00-05:00","gmt_time_start":"2010-03-05 16:00:00","gmt_time_end":"2010-03-05 17:00:00","gmt_time_end_last":"2010-03-05 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":["free_food"],"groups":[{"id":"1242","name":"School of Industrial and Systems Engineering (ISYE)"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}