INTERACTING DISCRETE EVENT SYSTEMS: MODELLING, VERIFICATION, AND SUPERVISORY CONTROL

Within the formal language and automata settings, a modelling and analysis paradigm for multiprocess discrete event systems is proposed. The modelling structure, referred to as one of interacting discrete event systems (IDES), features explicit representation of the system components. In addition, different forms of interactions between the components can be directly represented as interaction specification in the modelling structure. A multilevel extension to the model is introduced. The composition and decomposition operations for multiprocess systems are extended for the IDES model to incorporate the interaction specification. Several approaches are presented for verifying interacting discrete event systems. The proposed approaches do not require the computation of the synchronous product of the system components, and therefore avoid a major bottleneck in this class of problems. In one approach, the system is verified for internal correctness (nonblocking) by first detecting potential synchronization conflicts and then checking the reachability of the underlying states. External verification with respect to a given specification is also investigated. In certain situations, the interaction information can be used to solve the external verification problem modularly by converting the problem into an equivalent set of verification tests addressing the system components individually. In case the interaction specification does not provide enough information to verify the system modularly, an iterative procedure is presented to refine the interaction specification gradually until a solution is found.

[1]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[2]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[3]  Grzegorz Rozenberg,et al.  Shuffle on Trajectories: Syntactic Constraints , 1998, Theor. Comput. Sci..

[4]  Nicholas James Alsop.  Formal techniques for the procedural control of industrial processes , 1997 .

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  A. Karimi,et al.  Master‟s thesis , 2011 .

[7]  W. M. Wonham,et al.  Decentralized control and coordination of discrete-event systems with partial observation , 1990 .

[8]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[9]  Kurt Jensen.  Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.

[10]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems: The Cosy Approach , 1992 .

[11]  Jetty Kleijn,et al.  Restrictions and Representations of Vector Controlled Concurrent System Behaviours , 1997, Theor. Comput. Sci..

[12]  W. M. Wonham,et al.  On the consistency of hierarchical supervision in discrete-event systems , 1990 .

[13]  M. W. Shields.  Adequate Path Expressions , 1979, Semantics of Concurrent Computation.

[14]  Y. Brave.  Control of discrete event systems modeled as hierarchical state machines , 1993, IEEE Trans. Autom. Control..

[15]  Michael W. Shields.  Semantics of parallelism - non-interleaving representation of behaviour , 1997 .

[16]  W. M. Wonham,et al.  Modular supervisory control of discrete-event systems , 1988, Math. Control. Signals Syst..

[17]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[18]  Hong Liu,et al.  Hybrid synthesis for hierarchical structured Petri nets , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.

[19]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[20]  Roy H. Campbell,et al.  The specification of process synchronization by path expressions , 1974, Symposium on Operating Systems.

[21]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[22]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[23]  Hervé Marchand,et al.  Supervisory control of concurrent discrete event systems , 2004 .

[24]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[25]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[26]  Alberto L. Sangiovanni-Vincentelli,et al.  An Iterative Approach to Language Containment , 1993, CAV.

[27]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems , 1992, EATCS Monographs in Theoretical Computer Science.

[28]  R. Tennant.  Algebra , 1941, Nature.

[29]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[30]  Peter E. Caines,et al.  On Dynamically Consistent Hybrid Systems , 1994, Hybrid Systems.

[31]  R. Lathe.  Phd by thesis , 1988, Nature.

[32]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[33]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[34]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[35]  C. Petri.  Kommunikation mit Automaten , 1962 .