The Algebra of Multi-tasking

Authors:
Colin J. Fidge
Affiliations:
-
Venue:
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Year:
2000

Citing 11
Cited 1

Timing and causality in process algebra

Acta Informatica
Timing Analysis of Ada Tasking Programs

IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
A Process Algebraic Approach to the Schedulability Analysisof Real-Time Systems

Real-Time Systems
Communication and Concurrency

Communication and Concurrency
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Scheduling Algebra

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
A Formal Proof of the Deadline Driven Scheduler

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Analyzing a Real-Time Program with Z

ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Experiences in Embedded Scheduling

FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
The Meaning of Negative Premises in Transition System Specifications II

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Formalising Process Scheduling Requirements for an Aircraft Operational Flight Program

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods

Operational Semantics of Ada Ravenscar

Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.