[Newsletter] for September, 2013






                      ON DISCRETE EVENT SYSTEMS




Newsletter......................................... September, 2013




Editor: (Samuel) Qing-Shan Jia


         Chair, IEEE CSS Technical Committee on DES


         Center for Intelligent and Networked Systems


         Department of Automation


         Tsinghua University


         Beijing 100084






         Phone: (+86) 10-6277-3006


         Fax: (+86) 10-6279-6115


         e-mail: jiaqs@tsinghua.edu.cn


         WWW: http://cfins.au.tsinghua.edu.cn/personalhg/jiaqingshan/




It is the responsibility of the contributor to ensure that they have


the necessary permissions/clearance required for the transmittal of


their news item.










1. Editorial




2. Announcement


         2.1 The 5th ACM/IEEE International Conference on Cyber-Physical Systems


call for papers




3. Journals


  3.1 Selections from the Automatica


          Volume: 49, Issue: 9, September 2013


  3.2 Selections from the Discrete Event Dynamic Systems: Theory and Applications


     Volume: 23, Issue: 3, September 2013


  3.3 Selections from the IEEE Transactions on Automatic Control


          Volume: 58, Issue: 9, September 2013


  3.4 Selections from the International Journal of Control


     Volume: 86, Issue: 9, September 2013
















Welcome to the newsletter of the IEEE Control Systems Technical


Committee on Discrete Event Systems!




Personal note from the editor:




Welcome to the September 2013 newsletter.


















Contributed by: Christos G. Cassandras < cgc@bu.edu>




The 5th ACM/IEEE International Conference on Cyber-Physical Systems


April 15-17, 2014, Berlin, Germany








(Apologies for multiple copies of this announcement)




This 5th International Conference on Cyber-Physical Systems (ICCPS) will be held as part of CPS


Week 2014 to be held in Berlin, Germany on April 14-17, 2014.


As computers become ever-faster and communication bandwidth ever-cheaper, computing and


communication capabilities will be embedded in all types of objects and structures in the physical


environment. Applications with enormous societal impact and economic benefit will be created by


harnessing these capabilities in time and across space. Such systems that bridge the cyber-world of


computing and communications with the physical world are called cyber-physical systems.


Cyber-physical systems (CPS) are physical and engineered systems whose operations are monitored,


coordinated, controlled and integrated by a computing and communication core. This intimate


coupling between the cyber and physical will be manifested from the nano-world to large-scale,


wide-area systems of systems. And at multiple time-scales. Cyber-physical systems will transform


how we interact with the physical world just like the Internet transformed how we interact with one








The ICCPS 2014 conference will put specific emphasis on (but not limited to) the following


overarching themes


•       Transportation


•       Robotics


•       Energy


Work focused on theory, algorithms, implementation and field deployments will be of great interest


to the conference. Areas of interest to support these applications include (but not limited to):


control, optimization, machine learning, verification, data mining, signal processing, information


theory. Tools and technologies of interest include (but not limited to): sensor networks, embedded


systems, human in the loop systems, social networks, mobile computing, participatory sensing,


crowd-sourcing, cloud computing.






Submissions must be full papers. Regular submissions are at most 12 pages, including figures,


tables, and references. Notice that page limits are the MAXIMUM lengths. Paper qualities are not


judged by length. Submissions must be in PDF format, on single-spaced 8.5" x 11" (letter) pages of


two-column format, using 10-point type on 12-point (single-spaced) leading, with a maximum text


block of 7" wide x 9" deep. Left and right margins must be >= 0.75". Top and bottom margins must be


>= 1". Each column should be 3.33" with a 0.33" gutter. Each column must contain no more than 55


lines of text.




Key Dates:


The following submission deadlines and notification dates apply:


       •       Paper submission deadline: Oct. 14, 2013


       •       Notification: Jan. 17, 2014






General Co-Chairs:


            P.R. Kumar (Texas A&M University)


            Radu Stoleru (Texas A&M University)


TPC Co-Chairs:


            Alexandre Bayen (UC Berkeley)


            Michael Branicky (University of Kansas)














Contributed by: Yulin Lei < leiyl11@mails.tsinghua.edu.cn >




Selections from the Automatica


                                                        Volume: 49 Issue: 9


september 2013





Supervision localization of timed discrete-event systems




Renyuan Zhang, Kai Cai, Yongmei Gan, Zhaoan Wang, W.M. Wonham








We study supervisor localization for real-time discrete-event systems (DES) in the


Brandin–Wonham framework of timed supervisory control. We view a real-time DES


 as comprised of asynchronous agents which are coupled through imposed logical and


 temporal specifications; the essence of supervisor localization is the decomposition of


 monolithic (global) control action into local control strategies for these individual agents.


This study extends our previous work on supervisor localization for untimed DES, in that


monolithic timed control action typically includes not only disabling action as in the untimed


 case, but also “clock preempting” action which enforces prescribed temporal behavior.


The latter action is executed by a class of special events, called “forcible” events; accordingly,


we localize monolithic preemptive action with respect to these events. We demonstrate the


 new features of timed supervisor localization with a manufacturing cell case study and discuss


a distributed control implementation.




Web site: http://www.sciencedirect.com/science/article/pii/S0005109813002859








Contributed by: Yulin Lei < leiyl11@mails.tsinghua.edu.cn >




Selections from the Discrete Event Dynamic Systems: Theory and Applications


Volume: 23 Issue: 3


September 2013





Some insights of using common random numbers in selection procedures




E. Jack Chen








Indifference-zone selection procedures have been widely studied and applied to determine the sample


sizes for selecting a good system or a subset of good systems among k alternative systems. It is


known that using common random numbers can increase efficiency of simulation procedures, but using


common random numbers may also “backfire.” We show that it is generally safe to use common random


numbers to increase the probability of correct selection with Dudewicz and Dalal’s procedure as


well as its extension for subset selection when common random numbers are properly synchronized,


even though these selection procedures are derived based on independent sampling. The result is


derived with correlated order statistics in a concise manner, namely, the expected value of the


first-order statistic becomes larger as the (positive) covariances become stronger. We perform


simulation experiments to confirm this finding.




Web site: http://link.springer.com/article/10.1007/s10626-012-0142-2







Control of (max, +)-linear systems minimizing delays




Laurent Houssin, Sébastien Lahaye, Jean-Louis Boimond








In this paper, we develop a new control technique for discrete event dynamic systems subject to


synchronization phenomena. We propose a feedback controller for (max, + )-linear systems which


delays input events as little as possible while constraints on internal or output events are


satisfied. The synthesis is mainly based on new results about fixed points of antitone (i.e., order


reversing) mappings.




Web site: http://link.springer.com/article/10.1007/s10626-012-0143-1







Perturbation analysis of waiting times in the G/G/1 queue




Haralambie Leahu, Bernd Heidergott, Arie Hordijk








This paper is devoted to perturbation analysis of the stationary distribution of waiting times


 in the G/G/1 queue with a parameter-dependent service time distribution. We provide sufficient


conditions under which the stationary distribution is Lipschitz continuous and we explicitly compute


 the Lipschitz constant. Thereby, we provide bounds on the effect of a (finite) perturbation of


the service time distribution on the stationary waiting time. The case of infinitesimal


perturbations (read, derivatives) is treated as well.




Web site: http://link.springer.com/article/10.1007/s10626-012-0144-0







Comparative analysis of related notions of opacity in centralized and


coordinated architectures




Yi-Chin Wu, Stéphane Lafortune








Opacity is a confidentiality property that captures whether an intruder can infer a “secret” of a


 system based on its observation of the system behavior and its knowledge of the system’s


 structure. In this paper, we study four notions of opacity: language-based opacity, initial-state


 opacity, current-state opacity, and initial-and-final-state opacity. Initial-and-final-state opacity


is a new opacity property introduced in this paper, motivated by secrecy considerations in


anonymous network communications; the other three opacity properties have been studied


 in prior work. We investigate the relationships between these opacity properties. In this regard,


 a complete set of transformation algorithms among the four notions is provided. We also


propose a new, more efficient test for initial-state opacity based on the use of reversed automata,


and present a trellis-based test for the new property of initial-and-final state opacity. We then


study the notions of initial-state opacity, current-state opacity, and initial-and-final-state opacity


 in the context of a new coordinated architecture where two intruders work as a team in order


to infer the secret. In this architecture, the intruders have the capability of combining their


 respective state estimates at a coordinating node. In each case, a characterization of the


corresponding notion of “joint opacity” and an algorithmic procedure for its verification are provided.




Web site: http://link.springer.com/article/10.1007/s10626-012-0145-z








Contributed by: Yulin Lei < leiyl11@mails.tsinghua.edu.cn >




Selections from the IEEE Transactions on Automatic Control


                                             Volume: 58 Issue: 9


                                                   september 2013





On Event Triggered Tracking for Nonlinear Systems




Tallapragada, P.; Chopra, N.








In this technical note, we study an event-based control algorithm for trajectory tracking in


 nonlinear systems. The desired trajectory is modelled as the solution of a reference system


 with an exogenous input and it is assumed that the desired trajectory and the exogenous


 input to the reference system are uniformly bounded. Given a continuous-time control law


that guarantees global uniform asymptotic tracking of the desired trajectory, our algorithm


provides an event-based controller that not only guarantees uniform ultimate boundedness


of the tracking error, but also ensures non-accumulation of inter-execution times. In the case


 that the derivative of the exogenous input to the reference system is also uniformly bounded,


an arbitrarily small ultimate bound can be designed. If the exogenous input to the reference


system is piecewise continuous and not differentiable everywhere then the achievable ultimate


 bound is constrained and the result is local, though with a known region of attraction. The


main ideas in the technical note are illustrated through simulations of trajectory tracking by a


nonlinear system.




Web site: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6475158








Contributed by: Yulin Lei < leiyl11@mails.tsinghua.edu.cn >




Selections from the International Journal of Control


                      Volume: 86 Issue: 9


September 2013





Noncyclic Scheduling for Timed Discrete-Event Systems With Application


to Single-Armed Cluster Tools Using Pareto-Optimal Optimization




Eloy Garcia, Yongcan Cao, Han Yu, Panos Antsaklis, David Casbeer








This note studies event-triggered control of Multi-Agent Systems (MAS) with first-order integrator


dynamics. It extends previous work on event-triggered consensus by considering limited


communication capabilities through strict peer-to-peer non-continuous information exchange.


The approach provides both a decentralised control law and a decentralised communication policy.


Communication events require no global information and are based only on local state errors; agents do


not require a global sampling period or synchronous broadcasting as in sampled-data approaches.


The proposed decentralised event-triggered control technique guarantees that the inter-event times


for each agent are strictly positive. Finally, the ideas in this note are used to consider the practical


scenario where agents are able to exchange only quantised measurements of their states.




Web site: http://www.tandfonline.com/doi/full/10.1080/00207179.2013.787647










                                The End