Abstract
In the previous chapter, we introduced a version of ACP with relative timing and time measured on a discrete time scale. In this chapter, we will introduce a version of ACP with absolute timing and time measured on a discrete time scale. The version with absolute timing is generally considered to be less simple than the one with relative timing. Our main reason to consider absolute timing as well is that there are applications of process algebra with timing to which absolute timing is better suited than relative timing. It is likely that there are also applications for which it is convenient to use both absolute timing and relative timing. We obtain a generalization of both the version with absolute timing and the version with relative timing by adding a mechanism for parametric timing, called discrete initial abstraction, to the version with absolute timing. Thus, we integrate absolute timing and relative timing in an extension of the version with absolute timing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baeten, J.C.M., Middelburg, C.A. (2002). Discrete Absolute Timing. In: Process Algebra with Timing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04995-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-04995-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07788-3
Online ISBN: 978-3-662-04995-2
eBook Packages: Springer Book Archive