Symbolic Computation of Reduced Guards in Supervisory Control
نویسندگان
چکیده
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملCheap Computation of Optimal Reduced Models Using Symbolic Computation
Many methods have been proposed for the reduction of single-variable and multi-variable systems having ordinary denominators and those having delays in their numerators and denominators. In this paper, an algorithm for this purpose is proposed that can be easily used by anybody with not too advanced knowledge of mathematics yielding optimal reduced models. This algorithm makes use of the symbol...
متن کاملA symbolic approach to decentralized supervisory control of hybrid systems
We suggest a synthetic symbolic approach to decentralized supervisory control for the class of hybrid dynamical systems that can be modelled as hybrid state machines with a finite external signal space. The decentralized computational scheme represents a conjunction of a finite number of subsupervisors, which are invoked by a decomposition of the external signal space. On this basis, we derive ...
متن کاملPartial Observation in Distributed Supervisory Control of Discrete-Event Systems
Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...
متن کاملOn the computation of supremal sublanguages relevant to supervisory control
Given a specification language, this paper discusses an iterative procedure for the computation of the supremal sublanguage, that possesses a conjunction of certain closed-loop properties, including controllability, normality and completeness. The iteration is stated in terms of (i) supremal sublanguage operators for each individual property, (ii) prefix-closures, and, (iii) language intersecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automation Science and Engineering
سال: 2011
ISSN: 1545-5955
DOI: 10.1109/tase.2011.2146249