Decomposing Controllers into Non-conflicting Distributed Controllers

In this article we present an application of decompositions of automata to obtain distributed controllers. The decomposition technique is derived from the classical method of partitions. This is then applied to the domain of discrete event systems. We show that it is possible to decompose a monolithic controller into smaller controllers which are non-conflicting. This is derived from the notion of decompositions via partitions. Some global state information is necessary to ensure that the joint behaviour of the component automata is identical to the original controller. The global state information required is identical to the global information present in Zielonka asynchronous automata. The joint behaviour of the component automata is shown to be non-conflicting.

[1]  Stavros Tripakis.  Undecidable problems of decentralized observation and control on regular languages , 2004, Inf. Process. Lett..

[2]  Padmanabhan Krishnan.  A Model for Real-Time Systems , 1991, MFCS.

[3]  Padmanabhan Krishnan.  Independence in architectural descriptions , 1998, Proceedings. 1998 International Conference Software Engineering: Education and Practice (Cat. No.98EX220).

[4]  Padmanabhan Krishnan,et al.  A Framework for Security and Control , 2002, PDPTA.

[5]  Padmanabhan Krishnan.  Analysis of initial use case descriptions , 2004, IASTED Conf. on Software Engineering.

[6]  Padmanabhan Krishnan.  Uniform descriptions for model based testing , 2004, 2004 Australian Software Engineering Conference. Proceedings..

[7]  Padmanabhan Krishnan.  A Semantics for Multiprocessor Systems , 1992, ESOP.

[8]  P. Krishnan,et al.  Pre-Orders for Fault Tolerance , 1992 .

[9]  Ramaswamy Ramanujam.  A Local Presentation of Synchronizing Systems , 1995, STRICT.

[10]  Padmanabhan Krishnan,et al.  Using model checking to test a firewall: a case study , 2002, Proceedings. 28th Euromicro Conference.

[11]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[12]  P. Krishnan,et al.  A Process Algebraic Approach to Fault-Tolerance , 1992 .

[13]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[14]  Padmanabhan Krishnan.  Timed Automata and Embedded Systems , 1999 .

[15]  Bengt Jonsson,et al.  Compositional specification and verification of distributed systems , 1994, TOPL.

[16]  P Krishnan.  Making the common criteria more concrete , 2005 .

[17]  Padmanabhan Krishnan,et al.  A Calculus Based on Absence of Actions , 1995 .

[18]  Lei Wang,et al.  A framework for checking behavioral compatibility for component selection , 2006, Australian Software Engineering Conference (ASWEC'06).

[19]  Stavros Tripakis,et al.  Problems and Examples of Decentralized Observation and Control for Discrete Event Systems , 2002 .

[20]  Peter D. Mosses,et al.  Specifying Asynchronous Transfer of Control , 1992, Formal Techniques in Real-Time and Fault-Tolerant Systems.

[21]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

[23]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[24]  W. M. Wonham,et al.  Supervisor Reduction for Discrete-Event Systems , 2004, Discret. Event Dyn. Syst..

[25]  Padmanabhan Krishnan.  Automatic synthesis of schedulers in timed systems , 2000, Electron. Notes Theor. Comput. Sci..

[26]  Anca Muscholl,et al.  Synthesis of Distributed Algorithms Using Asynchronous Automata , 2003, CONCUR.

[27]  Padmanabhan Krishnan,et al.  Deriving distributed processes from concurrent processes , 1995, Inf. Softw. Technol..

[28]  Richard A. Volz,et al.  Distributed Ada: case study , 1991 .

[29]  Padmanabhan Krishnan,et al.  Providing assistance for proofs in the teaching of theory of computation , 2002, International Conference on Computers in Education, 2002. Proceedings..

[30]  S. Balemi,et al.  Supervisory control of a rapid thermal multiprocessor , 1993, IEEE Trans. Autom. Control..

[31]  Klaus Winkelmann,et al.  Controller synthesis for the “production cell” case study , 1998, FMSP '98.

[32]  Padmanabhan Krishnan,et al.  Specification , Verification and Synthesis : An Example , 2022 .

[33]  Padmanabhan Krishnan.  Hybrid Event Structures , 1996 .

[34]  P. Krishnan.  A Calculus of Timed Communicating Systems , 1992, Int. J. Found. Comput. Sci..

[35]  Padmanabhan Krishnan,et al.  Enabling Security Testing from Specification to Code , 2005, IFM.

[36]  Padmanabhan Krishnan,et al.  Issues Related to Distributed Processing of Picture Languages , 1999, J. Univers. Comput. Sci..

[37]  Padmanabhan Krishnan,et al.  Real-time action , 1991, Proceedings. EUROMICRO `91 Workshop on Real-Time Systems.

[38]  P. Ramadge,et al.  Modular Supervisory Control of Discrete Event Systems , 1988 .

[39]  J. Hartmanis.  Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics) , 1966 .

[40]  Padmanabhan Krishnan.  Automatic synthesis of a subclass of schedulers in timed systems , 2003, Theor. Comput. Sci..

[41]  Lei Wang,et al.  Supporting Partial Component Matching , 2004, ICDCIT.

[42]  Padmanabhan Krishnan,et al.  Decomposition of Timed Automata , 1999, J. Univers. Comput. Sci..

[43]  Padmanabhan Krishnan,et al.  A tool based approach to checking logical consistency in accident reports , 2002, Reliab. Eng. Syst. Saf..

[44]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[45]  Padmanabhan Krishnan.  Model-Checking and its Relevance , 1999 .

[46]  P. Krishnan,et al.  A distributed real-time language and its operational semantics , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[47]  Padmanabhan Krishnan.  Independent examination of software: an experiment , 2004, Inf. Softw. Technol..

[48]  Padmanabhan Krishnan,et al.  User Assisted Verification of Non-Repudiation and Similar Properties , 2003, Security and Management.

[49]  Antonio Cerone,et al.  Verifying BPEL Workflows Under Authorisation Constraints , 2006, Business Process Management.

[50]  R. A. Volz,et al.  Implementation of task types in distributed Ada , 1988, IRTAW '88.

[51]  W. Holcombe.  Algebraic automata theory: Contents , 1982 .

[52]  P. Krishnan,et al.  Pragmatics of the Action Semantics Approach: Fault Tolerance As An Example , 1994 .

[53]  Krishnan Padmanabhan.  Specification of Schedulers Using the Modal-p Calculus , 1994, Aust. Comput. J..

[54]  Padmanabhan Krishnan,et al.  Protocol Specification and Verification of Security Properties : A General Approach , 2022 .

[55]  Padmanabhan Krishnan,et al.  An Asynchronous Calculus Based on the Absence of Actions , 1997, J. Univers. Comput. Sci..

[56]  Padmanabhan Krishnan,et al.  An environment for specifying and verifying security properties , 2001, Proceedings 2001 Australian Software Engineering Conference.

[57]  Padmanabhan Krishnan,et al.  A Semantic Characterisation for Faults in Replicated Systems , 1994, Theor. Comput. Sci..

[58]  Padmanabhan Krishnan,et al.  Distributed CCS , 1991, CONCUR.

[59]  Lei Wang,et al.  An Approach to Provisioning E-Commerce Applications with Commercial Components , 2006, 2006 IEEE International Conference on e-Business Engineering (ICEBE'06).

[60]  Richard A. Volz,et al.  An approach to distributed execution of Ada programs , 1987 .

[61]  Padmanabhan Krishnan,et al.  Prototyping Electronic Commerce Systems Using Esterel , 2001, J. Organ. Comput. Electron. Commer..

[62]  Padmanabhan Krishnan,et al.  Decomposing Timed Push Down Automata , 2001, Fundam. Informaticae.

[63]  P. Krishnan,et al.  GUILE : Graphical User Interface for Linguistic Experiments , 1993 .

[64]  Padmanabhan Krishnan,et al.  A case study in specifying and testing architectural features , 1994, Microprocess. Microsystems.

[65]  Klaus Nökel,et al.  CSL: Controller synthesis and verification: A case study , 1995 .

[66]  Padmanabhan Krishnan.  Consistency checks for UML , 2000, Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000.

[67]  Amir Pnueli,et al.  Revised Lectures from the International Symposium on Compositionality: The Significant Difference , 1997 .

[68]  Padmanabhan Krishnan,et al.  Distributed timed automata , 1999, WDS@FCT.

[69]  P. Krishnan,et al.  A Process Algebraic Approach to Time Granularity Semantics , 1997, Int. J. Found. Comput. Sci..

[70]  Willem P. de Roever,et al.  The Need for Compositional Proof Systems: A Survey , 1997, COMPOS.

[71]  Andre Renaud.  Automatic Verification of Agreement and Secrecy , 2001 .