Skip to main content

On a Generalized Asymptoticity Problem in Max Algebra

  • Chapter
Discrete Event Systems: Modeling and Control

Part of the book series: Progress in Systems and Control Theory ((PSCT,volume 13))

Abstract

The asymptotic behaviour of an algorithm in max algebra is discussed. It can be seen as an extension of the concept of periodicity which has been treated in max-algebra literature. The main result is that the asymptotic behaviour of the algorithm is characterized by one or more critical circuits in a generalized sense, and that two cases can be distinguished. In the first case the generalized critical circuit has length two, and generalized order-2 periodicity is found. In the second case the generalized critical circuits are of length one, and generalized order-1 periodicity is stated. Only the case of 2 × 2-matrices is treated. The treatment of this specific case leads to the formulation of a more general set-up in which square matrices of any size can be included. The notion of generalized critical circuit is introduced.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. M. Gondran and M. Minoux. Graphs and algorithms. Wiley, 1984.

    Google Scholar 

  2. R.A. Cuninghame-Green. Minimax algebra. Springer-Verlag, New York, U.S.A., 1979.

    MATH  Google Scholar 

  3. U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures, volume 10 of Annals of discrete mathematics. North-Holland, 1981.

    Google Scholar 

  4. G. Cohen, D. Dubois, J.P. Quadrat, and M. Viot. A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. IEEE Transactions on Automatic Control, 30: 210–220, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  5. M. Minoux. Structures algébriques généralisées des problèmes de cheminement dans les graphes. RAIRO Recherche opérationnelle, 10: 33–62, 1976.

    MathSciNet  Google Scholar 

  6. J.A.C. Resing. Asymptotic results in feedback systems. PhD thesis, Delft University of Technology, Holland, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Braker, J.G., Resing, J.A.C. (1993). On a Generalized Asymptoticity Problem in Max Algebra. In: Balemi, S., Kozák, P., Smedinga, R. (eds) Discrete Event Systems: Modeling and Control. Progress in Systems and Control Theory, vol 13. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-9120-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-9120-2_10

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-9916-1

  • Online ISBN: 978-3-0348-9120-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics