A formal definition of priority in CSP

Authors:
C. J. Fidge
Affiliations:
Univ. of Queensland, Queensland, Australia
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1993

Citing 14
Cited 4

Communicating sequential processes

Communicating sequential processes
A review of Ada tasking

A review of Ada tasking
Communication and concurrency

Communication and concurrency
Transputer instruction set: a compiler writer's guide

Transputer instruction set: a compiler writer's guide
The notion of priority in real-time programming languages

Computer Languages
Usability of the Ada tasking-model

IRTAW '89 Proceedings of the third international workshop on Real-time Ada issues
The semantics of priority and fairness in OCCAM

Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Dynamic priorities, priority scheduling and priority inheritance

IRTAW '90 Proceedings of the fourth international workshop on Real-time Ada issues
Priority inheritance and message passing communication: a formal treatment

Real-Time Systems
Petri net semantics of priority systems

Selected papers of the Second Workshop on Concurrency and compositionality
Z: An Introduction to Formal Methods

Z: An Introduction to Formal Methods
Programming in OCCAM

Programming in OCCAM
Observing Task Preemption in Ada 9x

Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Translating Timed Process Algebra into Prioritized Process Algebra

Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems

CCS with Priority Guards

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A denotational semantics for Handel-C

Formal methods and hybrid real-time systems
Prioritized slotted-circus

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Slow abstraction via priority

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

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.