Communicating sequential processes
Communicating sequential processes
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
The equational theory of pomsets
Theoretical Computer Science
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Timing and causality in process algebra
Acta Informatica
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Study on the Specification and Verification of Performance Properties (Extended Abstract)
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
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.