The Algebra of Multi-tasking
Modelling multi-tasking behaviour is an important phase of real-time system design. It is shown how task scheduling principles can be captured in a CCS-based process algebra via extensions for both asymmetric interleaving, to model intraprocessor scheduling decisions, and for asynchronous communication, to model interprocessor precedence constraints. Examples are given of task preemption, blocking on shared resources, and multi-task transactions.
KeywordsPrecedence Constraint Schedule Operator Asynchronous Communication Partial Order Reduction Agent Expression
Unable to display preview. Download preview PDF.
- 5.L. Breveglieri, S. Crespi-Reghizzi, and A. Cherubini. Modeling operating systems schedulers with multi-stack-queue grammars. In G. Ciobanu and G. Păun, editors, Fundamentals of Computation Theory (FCT’99), volume 1684 of Lecture Notes in Computer Science, pages 161–172. Springer-Verlag, 1999.CrossRefGoogle Scholar
- 6.G. C. Buttazzo. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer, 1997.Google Scholar
- 8.J. S. Dong, N. Fulton, L. Zucconi, and J. Colton. Formalising process scheduling requirements for an aircraft operational flight program. In Proc. IEEE International Conference on Formal Engineering Methods (ICFEM’97), pages 161–169. IEEE Press, November 1997.Google Scholar
- 9.J. D. G. Falardeau. Schedulability analysis in rate monotonic based systems with application to the CF-188. Master’s thesis, Department of Electrical and Computer Engineering, Royal Military College of Canada, May 1994.Google Scholar
- 10.C. J. Fidge and J. J. Žic. An expressive real-time CCS. In Proc. Second Australasian Conference on Parallel and Real-Time Systems (PART’95), pages 365–372, Fremantle, September 1995.Google Scholar
- 12.D. M. Jackson. Experiences in embedded scheduling. In M.-C. Gaudel and J. Woodcock, editors, FME’96: Industrial Benefit and Advances in Formal Methods, volume 1051 of Lecture Notes in Computer Science, pages 445–464. Springer-Verlag, 1996.Google Scholar
- 13.J. Jacky. Analyzing a real-time program in Z. In Proc. Z User’s Meeting (ZUM’98), 1998.Google Scholar
- 15.R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
- 18.R. J. van Glabbeek. The meaning of negative premises in transition system specifications II. In F. Meyer auf der Heide and B. Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, volume 1099 of Lecture Notes in Computer Science, pages 502–513. Springer-Verlag, 1996. Extended abstract.Google Scholar
- 19.Z. Yuhua and Z. Chaochen. A formal proof of the deadline driven scheduler. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real Time and Fault Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 756–775. Springer-Verlag, 1994.Google Scholar