Please use this identifier to cite or link to this item:
|Title:||Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates||Authors:||Lin, Liyong
Wonham, Walter Murray
|Keywords:||Engineering::Electrical and electronic engineering||Issue Date:||2017||Source:||Lin, L., Stefanescu, A., Wang, W., Su, R., & Wonham, W. M. (2018). Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates. Automatica, 87, 290-300. doi:10.1016/j.automatica.2017.10.015||Journal:||Automatica||Abstract:||This paper studies the symbolic reachability relations of a class of parameterized systems in the framework of regular model checking. The modules of each system are instantiated from a globally synchronized template, and each globally synchronized template is represented by a finite state automaton whose event set consists of global events and local events. It is shown that the symbolic reachability relations of these systems are effectively iteration-closed star languages. And for any iteration-closed star language, there exists a template with only global events that realizes it. Application of the symbolic reachability analysis to computing the entrance control functions that enforce deadlock freeness and blocking freeness is then illustrated for systems with idle modules. In particular, we show that the maximally permissive entrance control functions can be encoded using finite state automata.||URI:||https://hdl.handle.net/10356/137871||ISSN:||0005-1098||DOI:||10.1016/j.automatica.2017.10.015||Rights:||© 2017 Elsevier Ltd. All rights reserved.This paper was published in Automatica and is made available with permission of Elsevier Ltd.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.