Abstract
Our goal is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, we propose axioms for transforming any specification term of a scheduling problem into a term of all valid schedules. Here a schedule is a process in which all (implementational) choices (e.g. precise timing) are resolved. In particular, we axiomatize an operator restricting attention to the efficient schedules. These schedules are representable as trees, because in an efficient schedule actions start only at time zero or when a resource is released, i.e. upon termination of the action binding a required resource. All further delay is useless. Nevertheless, we do not consider resource constraints explicitly here. We show that a normal form exists for every term of the algebra and establish both soundness of our axioms with respect to a schedule semantics and completeness for efficient processes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aceto, L.; Murphy, D.: Timing and Causality in Process Algebra, Acta Informatica 33, 1996, pp. 317–350
Baeten, J.C.M.; Bergstra, J.A.: Real Time Process Algebra, Formal Aspects of Computing 3(2), 1991, pp. 142–188
Bergstra, J.A.; Klop, J.W.: Process Algebra for Synchronous Communication, Information and Control 60, 1984, pp. 109–137
Chen, X.J.; Corradini, F.; Gorrieri, R.: A Study on the Specification and Verification of Performance Properties, Proceedings of AMAST’ 96, Lecture Notes in Computer Science 1101, Springer, Berlin, 1996, pp. 306–320
Clark, W.: The Gantt Chart: A Working Tool of Management, Pitman, London, 1935
Corradini, F.: On Performance Congruences for Process Algebras, Information and Computation 145(2), 1998, pp. 191–230
French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood, Chichester, 1982
Gischer, J.L.: The Equational Theory of Pomsets, Theoretical Computer Science 61, 1988, pp. 199–224
Glabbeek, R.J. van; Rittgen, P.: Scheduling Algebra, Arbeitsberichte des Instituts für Wirtschaftsinformatik Nr. 12, Universität Koblenz-Landau, Germany, 1998 http://www.uni-koblenz.de/~iwi/publicfiles/Arbeitsberichte/Nr12.ps.zip
Gorrieri, R.; Roccetti, M.; Stancampiano, E.: A Theory of Processes with Durational Actions, Theoretical Computer Science 140(1), 1995, pp. 73–94
Hoare, C.A.R.: Communicating Sequential Processes, Prentice Hall, Englewood Cliffs, 1985
Milner, R.: A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer, Berlin, 1980
Moller, F.; Tofts, C.: A Temporal Calculus of Communicating Systems, in: Baeten, J.C.M.; Klop, J.W.: Proceedings of CONCUR’ 90, Lecture Notes in Computer Science458, Springer, Berlin, 1990, pp. 401–415
Reed, G.M.; Roscoe, A.W.: A Timed Model for Communicating Sequential Processes, Theoretical Computer Science 58, 1988, pp. 249–261
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Glabbeek, R., Rittgen, P. (1998). Scheduling Algebra. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-49253-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65462-9
Online ISBN: 978-3-540-49253-5
eBook Packages: Springer Book Archive