Abstract
In this chapter we introduce the basic results from Min-plus that are needed for the next chapters. Max-plus algebra is dual to Min-plus algebra, with similar concepts and results when minimum is replaced by maximum, and infimum by supremum. As basic results of network calculus use more min-plus algebra than max-plus algebra, we present here in detail the fundamentals of min-plus calculus. We briefly discuss the care that should be used when max and min operations are mixed at the end of the chapter. A detailed treatment of Min- and Max-plus algebra is provided in [24], here we focus on the basic results that are needed for the remaining of the book. Many of the results below can also be found in [10] for the discrete-time setting.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2001). Basic Min-plus and Max-plus Calculus. In: Le Boudec, JY., Thiran, P. (eds) Network Calculus. Lecture Notes in Computer Science, vol 2050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45318-0_3
Download citation
DOI: https://doi.org/10.1007/3-540-45318-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42184-9
Online ISBN: 978-3-540-45318-5
eBook Packages: Springer Book Archive