Model Identification and Synthesis of Discrete-Event Systems

In the discrete-event system (DES) framework, input data are usually given in terms of behavioral descriptions (e.g. transition system and language) and the set of behavioral sequences may be fixed or may be increased in the course of identification by performing new experiments. While only a partial description of the system is assumed in identification, the synthesis problem starts from a complete description of the system. This chapter recalls some basic definitions and notations used in the sequel. In the sequel, it first discusses in detail an approach based on linear integer programming that provides a separating representation of the solution to the synthesis problem in its most general formulation, that is, without any simplifying assumption on the structure and labeling function of the synthesized net. In the second part, the chapter surveys several other similar approaches.

[1]  Robert Lorenz,et al.  Towards Synthesis of Petri Nets from Scenarios , 2006, ICATPN.

[2]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

[3]  C.N. Hadjicostis,et al.  State Estimation in Discrete Event Systems Modeled by Labeled Petri Nets , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[4]  Nidhal Rezg,et al.  Design of a live and maximally permissive Petri net controller using the theory of regions , 2003, IEEE Trans. Robotics Autom..

[5]  D. Angluin Queries and Concept Learning , 1988 .

[6]  Kunihiko Hiraishi Construction of a Class of Safe Petri Nets by Presenting Firing Sequences , 1992, Application and Theory of Petri Nets.

[7]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[8]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[9]  O. Nelles Nonlinear System Identification , 2001 .

[10]  Alessandro Giua,et al.  Identification of Petri Nets from Knowledge of Their Language , 2007, Discret. Event Dyn. Syst..

[11]  Sebastian Mauser,et al.  How to synthesize nets from languages - a survey , 2007, 2007 Winter Simulation Conference.

[12]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[13]  V. A. Kozlovskii,et al.  Analysis and synthesis of abstract automata , 2010 .

[14]  Robin Bergenthum,et al.  Process Mining Based on Regions of Languages , 2007, BPM.

[15]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[16]  Michael C. Mozer,et al.  Dynamic On-line Clustering and State Extraction: An Approach to Symbolic Learning , 1998, Neural Networks.

[17]  Peter Graubmann The Construction of EN Systems from a Given Trace Behavior , 1987, European Workshop on Applications and Theory of Petri Nets.

[18]  Padhraic Smyth,et al.  Learning Finite State Machines With Self-Clustering Recurrent Networks , 1993, Neural Computation.

[19]  Iickho Song,et al.  Identification of Finite State Automata With a Class of Recurrent Neural Networks , 2010, IEEE Transactions on Neural Networks.

[20]  Wil M. P. van der Aalst,et al.  Process Mining - Discovery, Conformance and Enhancement of Business Processes , 2011 .

[21]  Boudewijn F. van Dongen,et al.  Workflow mining: A survey of issues and approaches , 2003, Data Knowl. Eng..

[22]  Boudewijn F. van Dongen,et al.  Discovering Workflow Performance Models from Timed Logs , 2002, EDCIS.

[23]  Tadao Murata Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance , 1980, IEEE Transactions on Software Engineering.

[24]  E. Lopez-Mellado,et al.  Incremental synthesis of Petri net models for identification of discrete event systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[25]  Manuel Silva Suárez,et al.  Top-down synthesis of live and bounded free choice nets , 1990, Applications and Theory of Petri Nets.

[26]  Learning languages from positive data and a finite number of queries , 2006, Inf. Comput..

[27]  L. P. J. Veelenturf,et al.  AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS , 1981 .

[28]  Luciano Lavagno,et al.  Deriving Petri Nets for Finite Transition Systems , 1998, IEEE Trans. Computers.

[29]  Andrej Dobnikar,et al.  On-line identification and reconstruction of finite automata with generalized recurrent neural networks , 2003, Neural Networks.

[30]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[31]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[32]  Jehuda Kella Sequential Machine Identification , 1971, IEEE Transactions on Computers.

[33]  Kwang Y. Lee,et al.  Diagonal recurrent neural networks for dynamic systems control , 1995, IEEE Trans. Neural Networks.

[34]  Daniel N. Osherson,et al.  Criteria of Language Learning , 1982, Inf. Control..

[35]  John Case,et al.  Machine Inductive Inference and Language Identification , 1982, ICALP.

[36]  Lingxi Li,et al.  Least-Cost Transition Firing Sequence Estimation in Labeled Petri Nets , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[37]  Ramavarapu S. Sreenivas On minimal representations of Petri net languages , 2006, IEEE Transactions on Automatic Control.

[38]  Marc Richetin,et al.  Identification of automata by sequential learning , 1984, Pattern Recognit. Lett..

[39]  L. P. J. Veelenturf,et al.  Inference of Sequential Machines from Sample Computations , 1978, IEEE Transactions on Computers.

[40]  John Case,et al.  Language Learning with Some Negative Information , 1993, J. Comput. Syst. Sci..

[41]  Mariagrazia Dotoli,et al.  Real time identification of discrete event systems using Petri nets , 2008, Autom..

[42]  Boudewijn F. van Dongen,et al.  Process Discovery using Integer Linear Programming , 2009, Fundam. Informaticae.

[43]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[44]  Ludwik Czaja Making nets abstract and structures , 1985, Applications and Theory in Petri Nets.

[45]  Alberto Bemporad,et al.  Control of systems integrating logic, dynamics, and constraints , 1999, Autom..

[46]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..