Skip to main content
SpringerLink
Log in

Decomposing Controllers into Non-conflicting Distributed Controllers

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2004 (ICTAC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3407))

Included in the following conference series:

Abstract

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.

Part of this work was supported by Siemens Research, Munich, Germany.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balemi, S., Hoffmann, G., Gyugyi, P., Wong-Toi, H., Franklin, G.: Supervisory Control of a Rapid Thermal Multiprocessor. IEEE Trans. on Automatic Control 38, 1040–1059 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bryant, R.E.: Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers C35(8), 677–691 (1986)

    Article  MATH  Google Scholar 

  3. de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.): COMPOS 1997. LNCS, vol. 1536, p. 1. Springer, Heidelberg (1998)

    Book  Google Scholar 

  4. Holcombe, W.M.L.: Algebraic Automata Theory. Cambridge University Press, Cambridge (1982)

    Book  MATH  Google Scholar 

  5. Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice Hall, Englewood Cliffs (1966)

    MATH  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (1979)

    MATH  Google Scholar 

  7. Jones, M.: An introduction to HUGS, Version 1.01. University of Nottingham (1994)

    Google Scholar 

  8. Jonsson, B.: Compositional specification and verification of distributed systems. ACM Transactions on Programming Languages and Systems 16(2), 259–303 (1994)

    Article  Google Scholar 

  9. Melcher, H., Winkelmann, K.: Controller synthesis for the production cell case study. In: Ardis, M. (ed.) Proceedings of the 2nd Workshop on Formal Methods in Software Practice FMSP 1998, March 4-5. ACM Press, New York (1998)

    Google Scholar 

  10. Noekel, K., Winkelmann, K.: CSL. In: Lewerentz, C., Lindner, T. (eds.) Formal Development of Reactive Systems. LNCS, vol. 891, pp. 55–74. Springer, Heidelberg (1995)

    Google Scholar 

  11. Puri, A., Tripakis, S., Varaiya, P.: Problems and examples of decentralized observation and control for discrete event systems. In: Symposium on the Supervisory Control of Discrete Event Systems (2001)

    Google Scholar 

  12. Ramanujam, R.: A local presentation of synchronizing systems. In: Structures in Concurrency Theory, Springer Workshops in Computing, pp. 91–118. Springer, Heidelberg (1995)

    Google Scholar 

  13. Ramadge, P.J.G., Wonham, W.M.: The Control of Discrete Event Systems. Proceedings of the IEEE 77(1), 81–98 (1989)

    Google Scholar 

  14. Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 27–41. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Su, R., Wonham, W.M.: Supervisory Reduction for Discrete-Event Systems. Discrete Event Dynamic Systems 14(1), 31–53 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Tripakis, S.: Undecidable problems of decentralized observation and control on regular languages. Information Processing Letters 90(1), 21–28 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Wonham, W.M.: Supervisory control of discrete-event systems (updated notes). Technical report, Systems Control Group, University of Toronto, Canada (2004)

    Google Scholar 

  18. Wonham, W.M., Ramadge, P.J.G.: Modular Supervisory Control of Discrete Event Systems. Mathematics of Control, Signals and Systems 1(1), 13–30 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  19. Zhang, Y.: Software for State-Event Observation Theory and its Application to Supervisory Control. Master’s thesis, Department of Control Engineering, University of Toronto, Canada (1996)

    Google Scholar 

  20. Zielonka, W.: Notes on Finite Asynchronous Automata. RAIRO: Theoretical Informatics and Applications 21(2), 101–135 (1987)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Software Assurance, Faculty of Information Technology, Bond University, Gold Coast, Queensland, 4229, Australia

    Padmanabhan Krishnan

Authors
  1. Padmanabhan Krishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute of Software Technology, United Nations University, Macau, China

    Zhiming Liu

  2. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krishnan, P. (2005). Decomposing Controllers into Non-conflicting Distributed Controllers. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31862-0_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25304-4

  • Online ISBN: 978-3-540-31862-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation