Skip to main content
SpringerLink
Log in

Controllers for discrete event systems via morphisms

  • Conference paper
  • First Online:
CONCUR'98 Concurrency Theory (CONCUR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1466))

Included in the following conference series:

Abstract

We study the problem of synthesising controllers for discrete event systems. Traditionally this problem is tackled in a linear time setting. Moreover, the desired subset of the computations of the uncontrolled system (often called a plant) is specified by automata theoretic means. Here we formulate the problem in a branching time framework. We use a class of labelled transition systems to model both the plant and the specification. We deploy behaviour preserving morphisms to capture the role of a controller; the controlled behaviour of the plant should be related via a behaviour preserving morphism to the specification at the level of unfoldings. One must go over to unfoldings in order to let the controller use memory of the past to carry out its function.

We show that the problem of checking if a pair of finite transition systems — one modelling the plant and the other the specification — admits a controller is decidable in polynomial time. We also show the size of the finite controller, if one exists can be bounded by a polynomial in the sizes of the plant and the specification. Such a controller can also be effectively constructed. We then prove that in a natural concurrent setting, the problem of checking for the existence of a (finite) controller is undecidable.

This research has been supported by the IFCPAR project 1502-1.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Asarin, O. Maler, A. Pnueli: Symbolic Controller Synthesis for Discrete and Timed Systems, in P. Antsaklis, W. Kohn, A. Nerode and S. Sastry (Eds.), Hybrid Systems II, 1–20, LNCS 999, Springer, 1995

    Google Scholar 

  2. J. R. Büchi and L. H. Landweber: Solving sequential conditions by finite-state strategies, Trans. Amer. Math. Soc. 138 (1969) 295–311.

    Article  MathSciNet  Google Scholar 

  3. A. Church: Logic, arithmetic and automata, Proc. Intern. Congr. Math. 1960, Almquist and Wiksells, Uppsala (1963).

    Google Scholar 

  4. B. Jonsson and K. G. Larsen: On the complexity of equation solving in process algebra, LNCS 493, Springer-Verlag (1991) 381–396

    Google Scholar 

  5. Ratnesh Kumar, Vijay K. Garg: Modeling and Control of Logical Discrete Event Systems, Kluwer Academic Publishers, 1995

    Google Scholar 

  6. Ratnesh Kumar, Vijay Garg, Steven I. Marcus: On Controllability and Normality of Discrete Event Dynamical Systems. Systems and Control Letters, 17(3):157–168, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. Ratnesh Kumar, Mark A. Shayman: Centralized and Decentralized Supervisory Control of Nondeterministic Systems Under Partial Observation. In Proceedings of 1994 IEEE Conference on Decision and Control, Orlando, FL, December 1994. 3649–3654

    Google Scholar 

  8. K. G. Larsen and L. Xinxin: Equation solving using modal transition systems, LICS'90, Philadelphia, PA, U.S.A., (1990) 108–117.

    Google Scholar 

  9. H. Lewis and C. H. Papadimitriou: Elements of the theory of computation, Prentice Hall, New Jersey, U.S.A. (1981).

    Google Scholar 

  10. N. Lynch and F. Vaandrager: Forward and backward simulations, Information and Computation, 121 (2) (1995) 214–233

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Madhusudan and P. S. Thiagarajan: Controllers for Discrete Event Systems via Morphisms, Technical Report TCS-98-02, SPIC Mathematical Institute, Chennai, India (1998). Available at http://www.smi.ernet.in.

    Google Scholar 

  12. A. Overkamp: Supervisory control using failure semantics and partial specifications, IEEE Trans. on Automatic Control, Vol. 42, No. 4 (1997) 498–510

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Pnueli and R. Rosner: On the synthesis of a reactive module, Proc. 16th ACM Symp. Princ. of Prog. Lang. (1989) 179–190.

    Google Scholar 

  14. P. J. G. Ramadge and W. M. Wonham: The control of discrete event systems, Proc. of IEEE 77 (1989) 81–98.

    Google Scholar 

  15. W. Thomas: Finite strategies in regular infinite games, LNCS 880, Springer-Verlag (1994) 149–158.

    Google Scholar 

  16. G. Winskel and M. Nielsen: Models for concurrency, In: S. Abramsky and D. Gabby (Eds.), Handbook of Logic in computer Science, Vol. 3, Oxford University Press, Oxford, U.K. (1994).

    Google Scholar 

  17. K. C. Wong, W. M. Wonham: Modular Control and Coordination of Discrete-Event Systems, Discrete Event Dynamic Systems, 6(3):241–273, July 1996

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematical Sciences, C.I.T. Campus, Taramani, Chennai, India

    P. Madhusudan

  2. SPIC Mathematical Institute, 92 G.N.Chetty Road, T.Nagar, Chennai, India

    P. S. Thiagarajan

Authors
  1. P. Madhusudan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. S. Thiagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madhusudan, P., Thiagarajan, P.S. (1998). Controllers for discrete event systems via morphisms. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055613

Download citation

  • DOI: https://doi.org/10.1007/BFb0055613

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation