Submodule Construction and Supervisory Control: A Generalization

  • Gregor v. Bochmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2494)


We consider the following problem: For a system consisting of two submodules, the behavior of one submodule is known as well as the desired behavior S of the global system. What should be the behavior of the second submodule such that the behavior of the composition of the two submodules conforms to S? - This problem has also been called “equation solving”, and in the context of supervisory control, it is the problem of designing a suitable controller (second submodule) which controls a given system to be controlled (first submodule). Solutions to this problem have been described by different authors for various assumptions about the underlying communication mechanisms and conformance relations. We present a generalization of this problem and its solution using concepts from relational database theory. We also show that several of the existing solutions are special cases of our general formulation


Relational Database Finite State Machine Supervisory Control Label Transition System Execution Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Abit 95]
    S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases, Addison-Wesley, 1995.Google Scholar
  2. [Boch 80d]
    G. v. Bochmann and P. M. Merlin, On the construction of communication protocols, ICCC, 1980, pp. 371–378, reprinted in “Communication Protocol Modeling”, edited by C. Sunshine, Artech House Publ., 1981; russian translation: Problems of Intern. Center for Science and Techn. Information, Moscow, 1981, no. 2, pp. 146–155.Google Scholar
  3. [Boch 01b]
    G. v. Bochmann, Submodule construction-the inverse of composition, Technical Report, Sept. 2001, University of Ottawa.Google Scholar
  4. [Bran 94]
    B. A. Brandin and W. M. Wonham, Supervisory Control of Timed Discrete-Event Systems, IEEE Tran, on Automatic Control, Vol. 39, No. 2, Feb. 1994.Google Scholar
  5. [Dris 99a]
    J. Drissi and G. v. Bochmann, Submodule construction tool, in Proc. Int. Conf. on Computational Intelligence for Modelling, Control and Automation, Vienne, Febr. 1999, (M. Mohammadian, Ed.), IOS Press, pp. 319–324.Google Scholar
  6. [Dris 99b]
    J. Drissi and G. v. Bochmann, Submodule construction for systems of I/O automata, submitted for publication.Google Scholar
  7. [Dris 00]
    J. Drissi and G. v. Bochmann, Submodule construction for systems of timed I/O automata, submitted for publication, see also J. Drissi, PhD thesis, University of Montreal, March 2000 (in French).Google Scholar
  8. [Hagh99]
    E. Haghverdi and H. Ural, Submodule construction from concurrent system specifications, Information and Software Technology, Vo. 41 (1999), pp. 499–506.CrossRefGoogle Scholar
  9. [Hoar 85]
    C. A. R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985.Google Scholar
  10. [Kele 94]
    S. G. H. Kelekar, Synthesis of protocols and protocol converters using the submodule construction approach, Proc. PSTV, XIII, A. Danthine et al (Eds), 1994.Google Scholar
  11. [Kim 97]
    T. Kim, T. Villa, K. Brayton, A.Sangiovanni-Vincentelli. Synthesis of FSMs: functional optimization. Kluwer Academic Publishers, 1997.Google Scholar
  12. [Maie 83]
    D. Maier, The Theory of Relational Databases, Computer Science Press, Rockville, Maryland, 1983.zbMATHGoogle Scholar
  13. [Male 95]
    O. Maler, A. Pnueli and J. Sifakis, On the synthesis of discrete controllers for timed systems, STACS 95, Annual Symp. on Theoretical Aspects of Computer Science, Berlin, 1995, Springer Verlag, pp. 229–242.Google Scholar
  14. [Merl 83]
    P. Merlin and G. v. Bochmann, On the Construction of Submodule Specifications and Communication Protocols, ACM Trans, on Programming Languages and Systems, Vol. 5, No. 1 (Jan. 1983), pp. 1–25.zbMATHCrossRefGoogle Scholar
  15. [Parr 89]
    J. Parrow, Submodule Construction as Equation Solving in CCS, Theoretical Computer Science, Vol. 68, 1989.Google Scholar
  16. [Petr 96a]
    A. Petrenko, N. Yevtushenko, G. v. Bochmann and R. Dssouli, Testing in context: framework and test derivation, Computer Communications Journal, Special issue on Protocol engineering, Vol. 19, 1996, pp. 1236–1249.Google Scholar
  17. [Petr 98]
    A. Petrenko and N. Yevtushenko, Solving asynchronous equations, in Proc. ofIFIP FORTE/PSTV’98 Conf, Paris, Chapman-Hall, 1998.Google Scholar
  18. [Qin 91]
    H. Qin and P. Lewis, Factorisation of finite state machines under strong and observational equivalences, J. of Formal Aspects of Computing, Vol. 3, pp. 284–307, 1991.CrossRefGoogle Scholar
  19. [Rama 89]
    P. J. G. Ramadge and W. M. Wonham, The control of discrete event systems, in Proceedings of the IEEE, Vo. 77, No. 1 (Jan. 1989).Google Scholar
  20. [Tao 97a]
    Z. Tao, G. v. Bochmann and R. Dssouli, A formal method for synthesizing optimized protocol converters and its application to mobile data networks, Mobile Networks & Applications, vol. 2, no. 3, 1997, pp. 259–69. Publisher: Baltzer; ACM Press, Netherlands.Google Scholar
  21. [Tao 95d]
    Z. P. Tao, G. v. Bochmann and R. Dssouli, A model and an algorithm of subsystem construction, in proceedings of the Eighth International Conference on parallel and distributed computing systems, Sept. 21–23, 1995 Orlando, Florida, USA, pp. 619–622.Google Scholar
  22. [This 95]
    J. G. Thistle, On control of systems modelled as deterministic Rabin automata, Discrete Event Dynamic Systems: Theory and Applications, Vol. 5, No. 4 (Sept. 1995), pp. 357–381.zbMATHCrossRefGoogle Scholar
  23. [YevtOla]
    N. Yevtushenko, T. Villa, R. Brayon, A. Petrenko, A. Sangiovanni-Vincentelli. Synthesis by language equation solving (exended abstract), in Proc. of Annual Intern.workshop on Logic Snthesis, 2000, 11–14; complete paper to be published in ICCAD’2001; see also Solving Equations in Logic Synthesis, Technical Report, Tomsk State University, Tomsk, 1999,27 p. (in Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Gregor v. Bochmann
    • 1
  1. 1.School of Information Technology and Engineering (SITE)University of OttawaCanada

Personalised recommendations