[Newsletter] for October, 2013






                      ON DISCRETE EVENT SYSTEMS




Newsletter......................................... October, 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






3. Journals


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


         Volume: 23, Issue: 4, December 2013


         Special Section of Modeling of Reactive Systems


  3.2 Selections from the IEEE Transactions on Automatic Control


          Volume: 58, Issue: 10, October 2013


  3.3 IEEE Transactions on Automation Science and Engineering


         Volume: 10, Issue: 10, October 2013


















Welcome to the newsletter of the IEEE Control Systems Technical


Committee on Discrete Event Systems!




Personal note from the editor:




Welcome to the October 2013 newsletter.


















Contributed by: Ernesto Lopez-Mellado < elopez@gdl.cinvestav.mx>








(Apologies for multiple copies of this announcement)




Dear colleagues,




We are organising a special session on DISCRETE EVENT PROCESS MINING / IDENTIFICATION at the next


12th IFAC International Workshop on Discrete Event Systems (WODES) that will be held in Paris-


Cachan, France, on May 14-16, 2014.




Special sessions papers will follow the calendar and the reviewing process of regular papers whose


deadline for submission is November 8th. For details on submissions, please consult the site


http://wodes2014.lurpa.ens-cachan.fr/. If you intend to submit a contribution to this special


session, please send us immediately an expression of interest and later send us a title, authors,


and abstract by October 28th.




Below we are appending the session’s topic description. If you need further information do not


hesitate to contact us.




Hoping to hear from you soon, we send you our best regards.




Mariagrazia Dotoli


Ernesto Lopez-Mellado




Special Session








Keywords: DES identification; Workflow mining; Process discovery; Automated modelling.




Organisers:  M. Dotoli, Politecnico di Bari


                     E. Lopez-Mellado, CINVESTAV Unidad Guadalajara




Automated modelling of discrete event processes from external observation of their behaviour is a


research topic that received a lot of attention in the last decade. This problem has been addressed


by the Discrete Event Systems (DES) and Workflow Management Systems (WMS) communities, under


different names (DES Identification and Workflow mining, respectively) and approaches. Although


there are several proposed approaches in each field, much remains to be done regarding efficiency


of the methods and their practical application.




The aim of this special session is presenting new approaches and methods on discrete event process


mining while gathering research contributions in both DES and WMS areas. This will allow fostering


the discussion and exchange on common and related problems regarding both theoretical and


application issues. We are encouraging submissions addressing applications and the inherent


problems regarding efficiency on diverse domains (manufacturing, banking, hospital management,


model verification ...).








Mariagrazia DOTOLI


DEI - Politecnico di Bari


Via Re David 200. 70125 Bari, Italy


Tel. +39 080-5963667 Fax. +39 080-5963410


Email: dotoli@deemail.poliba.it






CINVESTAV Unidad Guadalajara


Av. Del Bosque 1145, Col. El Bajio. 45019 Zapopan, Jal. Mexico


Tel: +52 33 37773600,  Fax: +52 33 37773609


Email: elopez@gdl.cinvestav.mx














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




Selections from the Discrete Event Dynamic Systems: Theory and Applications


Volume: 23 Issue: 4


December 2013


Special section of Modeling of Reactive Systems





Operational semantics of a domain specific language for real time


musician–computer interaction




José Echeveste, Arshia Cont, Jean-Louis Giavitto, Florent Jacquemard








With the advent and availability of powerful personal computing, the computer music research


and industry have been focusing on real-time musical interactions between musicians and


computers; delegating human-like actions to computers who interact with a musical environment.


One common use-case of this kind is Automatic Accompaniment where the system is comprised of a


real-time machine listening system that in reaction to recognition of events in a score from a


human performer, launches necessary actions for the accompaniment section. While the real-time


detection of score events out of live musicians’ performance has been widely addressed in the


literature, score accompaniment (or the reactive part of the process) has been rarely


discussed. This paper deals with this missing component in the literature from a formal


language perspective. We show how language considerations would enable better authoring of time


and interaction during programming/composing and how it addresses critical aspects of a musical


performance (such as errors) in real-time. We sketch the real-time features required by


automatic musical accompaniment seen as a reactive system. We formalize the timing strategies


for musical events taking into account the various temporal scales used in music. Various


strategies for the handling of synchronization constraints and the handling of errors are


presented. We give a formal semantics to model the possible behaviors of the system in terms of


Parametric Timed Automata.




Web site: http://link.springer.com/article/10.1007/s10626-013-0166-2







Integrating discrete controller synthesis into a reactive programming language compiler




Gwenaël Delaval, Eric Rutten, Hervé Marchand








We define a mixed imperative/declarative programming language: declarative contracts


 are enforced upon imperatively described behaviors. This paper describes the semantics


 of the language, making use of the notion of Discrete Controller Synthesis (DCS). We target


 the application domain of adaptive and reconfigurable systems: our language can serve


programming closed-loop adaptation controllers, enabling flexible execution of functionalities w.r.t.


changing resource and environment conditions. DCS is integrated into a1 programming language


compiler, which facilitates its use by users and programmers, performing executable code generation.


 The tool is concretely built upon the basis of a reactive programming language compiler, where the


 nodes describe behaviors that can be modeled in terms of transition systems. Our compiler


 integrates this with a DCS tool, making it a new environment for formal methods. We define


the trace semantics of our contracts language, describe its compilation and establish its


correctness, and discuss implementation and examples.




Web site: http://link.springer.com/article/10.1007/s10626-013-0163-5







Shrinking of Time Petri nets




Didier Lime, Claude Martinez, Olivier H. Roux








The problem of the synthesis of time bounds enforcing good properties for reactive systems


 has been much studied in the literature. These works mainly rely on dioid algebra theory


 and require important restrictions on the structure of the model (notably by restricting to


 timed event graphs). In this paper, we address the problems of existence and synthesis of


 shrinkings of the bounds of the time intervals of a time Petri net, such that a given property


 is verified. We show that this problem is decidable for CTL properties on bounded time


Petri nets. We then propose a symbolic algorithm based on the state class graph for a fragment


 of CTL. If the desired property “includes” k-boundedness, the proposed algorithm terminates


 even if the net is unbounded. A prototype has been implemented in our tool Romeo and the


method is illustrated on a small case study from the literature.




Web site: http://link.springer.com/article/10.1007/s10626-013-0159-1








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




Selections from the IEEE Transactions on Automatic Control


                                             Volume: 58 Issue: 10


                                                   October 2013





A Novel Event-Triggered Transmission Scheme and  {cal L}_{2} Control


Co-Design for Sampled-Data Control Systems




Peng, C. ; Han, Q.-L








This note is concerned with the event-triggered ${cal L}_{2}$ control for a sampled-data


control system. A novel event-triggered transmission scheme is first proposed to determine


whether or not the sampled-data should be transmitted. Under this scheme, the sampled-data


transmission should be executed only when a threshold is violated, which means that less


sampled-data is transmitted. This scheme does not require any special hardware for continuous


measurement. Then, the sampled-data control system is modeled as a sampled-data error dependent


system. A stability criterion is derived by constructing a novel Lyapunov-Krasovskii functional


which fully utilizes the sawtooth structure characteristic of an artificial delay. Based on


this stability criterion, a sufficient condition on the existence of a state feedback


controller is given. A co-design algorithm is provided to obtain the parameters of the event-


triggered transmission scheme and the controller gain simultaneously. Finally, an inverted


pendulum example is given to show the effectiveness of the event-triggered transmission scheme


and the co-design algorithm.




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








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




Selections from the IEEE Transactions on Automation Science and Engineering


                                             Volume: 10 Issue: 4


                                                   October 2013





Polynomial Test for Stochastic Diagnosability of Discrete-Event Systems




Chen, J.; Kumar, R.








Two types of diagnosability of stochastic discrete-event systems (DESs) were introduced


by Thorsley in 2005, where a necessary and sufficient condition for Strong Stochastic


(SS)-Diagnosability (referred as A-diagnosability by Thorsley and Teneketzis, 2005), and a sufficient


 condition for Stochastic (S)-Diagnosability (referred as AA-diagnosability by Thorsley and Teneketzis, 2005),


both with exponential complexity, were reported. In this paper, we present polynomial


complexity tests for checking: (i) necessity and sufficiency of SS-Diagnosability; (ii) sufficiency


of S-Diagnosability; and (iii) sufficiency as well as necessity of S-Diagnosability; the latter requires


 an additional notion of probabilistic equivalence. Thus, the work presented improves the


accuracy as well as the complexity of verifying stochastic diagnosability.




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







Modular Modeling for the Diagnostic of Complex Discrete-Event Systems




Gascard, E.; Simeu-Abazi, Z.








For the complex systems, the development of a methodology of fault diagnosis


 is important. Indeed, for such systems, an efficient diagnosis contributes to the


improvement of the availability, the growth of production, and, of course, the reduction


 of maintenance costs. It is a key action in the improvement of performance of


industrial feature. This paper proposes a new approach to diagnose complex systems


modeled by communicating timed automata. Each component has been modeled separately


by a timed automaton integrating various operating modes while the communication


between the various components is carried out by the control module. Starting from each


 module of the complex system, a single deterministic automaton, called a diagnoser, is


constructed that uses observable events to detect the occurrence of a failure. This modeling


formalism provides means for formal verification of the complex system model and its


diagnoser. The model-checking methods are used to check correctness properties. The steps


 of the method are described by an algorithm and illustrated through a batch neutralization


 process. The implementation of the algorithm is also discussed.




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







On Deciding the Existence of a Liveness Enforcing Supervisory Policy in a Class of Partially


Controlled General Free-Choice Petri Nets




Somnath, N.; Sreenivas, R.S.








If there are transitions in a Petri net (PN) that cannot be prevented from firing by a


supervisory policy, then we have a partially controlled PN. The existence of a liveness


enforcing supervisory policy (LESP) in a partially controlled ordinary PN is undecidable.


Consequently, there can be no algorithms that synthesize an LESP for an arbitrary ordinary


(general) PN. In contrast, we identify a class of general free-choice PN (FCPN) structures,


which strictly includes the class of ordinary FCPN structures, where the existence of an LESP


in any marked member of the class is decidable.




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










                                                    The End