[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Investigating Discrete Controllability with Kleene Algebra

  • Conference paper
Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 2003)

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

Included in the following conference series:

  • 376 Accesses

Abstract

A Discrete Event System (DES) is a dynamic system whose evolution is governed by the instantaneous occurrence of physical events. DES arise in many areas such as robotics, manufacturing, communication networks, and transportation. They are often modelled by languages or automata over an alphabet of symbols denoting the events. In 1987, Ramadge and Wonham initiated a very successful approach to the control of DES [10, 13], which was subsequently extended by themselves and others. Textbooks or course notes on the subject include [1, 7, 12].

This research is supported by FQRNT (Fonds québécois de la recherche sur la nature et les technologies).

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Boston (1999)

    MATH  Google Scholar 

  2. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  3. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  4. Desharnais, J., Möller, B.: Characterizing determinacy in Kleene algebras. Information Sciences 139, 253–273 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. von Karger, B., Hoare, C.A.R.: Sequential calculus. Information Processing Letters 53, 123–130 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems 19, 427–443 (1997)

    Article  Google Scholar 

  7. Kumar, R., Garg, V.K.: Modeling and Control of Logical Discrete Event Systems. Kluwer Academic Publishers, Boston (1995)

    MATH  Google Scholar 

  8. Möller, B.: Derivation of graph and pointer algorithms. In: Möller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol. 755, pp. 123–160. Springer, Heidelberg (1993)

    Google Scholar 

  9. Möller, B.: Residuals and detachment. Personal communication (2001)

    Google Scholar 

  10. Ramadge, P.J.G., Wonham, W.M.: Supervisory control of a class of discreteevent processes. SIAM J. on Control and Optimization 25, 206–230 (1987)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  12. Wonham, W.M.: Notes on control of discrete event systems. Systems Control Group, Edward S. Rogers Sr. Dept. of Electrical & Computer Engineering, University of Toronto, pp. xiv+356 (2002), Available at http://www.control.utoronto.ca/people/profs/wonham/wonham.html

  13. Wonham, W.M., Ramadge, P.J.G.: On the supremal controllable sublanguage of a given language. SIAM J. on Control and Optimization 25, 637–659 (1987)

    Article  MathSciNet  Google Scholar 

  14. Young, S.D., Garg, V.K.: Optimal sensor and actuator choices for discrete event systems. In: 31st Allerton Conf. on Communication, Control, and Computing, Allerton, IL (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bherer, H., Desharnais, J., Frappier, M., St-Denis, R. (2004). Investigating Discrete Controllability with Kleene Algebra. In: Berghammer, R., Möller, B., Struth, G. (eds) Relational and Kleene-Algebraic Methods in Computer Science. RelMiCS 2003. Lecture Notes in Computer Science, vol 3051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24771-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24771-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22145-6

  • Online ISBN: 978-3-540-24771-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics