A formal definition of priority in CSP
- 1 September 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (4) , 681-705
- https://doi.org/10.1145/155183.155221
Abstract
The process models of Ada and occam are formally based on the CSP process algebra. However, for fine-tuning real-time performance, they include “prioritized” constructs that have no counterparts in CSP. These constructs therefore lack any formal definition, a situation that leaves room for misunderstandings. We extend CSP with a formal definition of the notion of priority. The definition is then used to assess the transputer implementation of priority in occam and the definition of priority in Ada.Keywords
This publication has 6 references indexed in Scilit:
- Petri net semantics of priority systemsTheoretical Computer Science, 1992
- Priority inheritance and message passing communication: A formal treatmentReal-Time Systems, 1991
- The notion of priority in real-time programming languagesComputer Languages, 1990
- Dynamic priorities, priority scheduling and priority inheritanceACM SIGAda Ada Letters, 1990
- Usability of the Ada tasking-modelACM SIGAda Ada Letters, 1989
- A Review of Ada TaskingPublished by Springer Nature ,1987