Abstract
We present initial work on a timed process algebra that models sharing of processor resources allowing preemption at arbitrary points in time. This enables us to model both the functional and the timely behaviour of concurrent processes executed on a single processor. We give a refinement relation that describes that one process is more deterministic than another. Applications of the model for process scheduling, programming language semantics, and kernel development are outlined.
| Original language | English |
|---|---|
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 52 |
| Issue number | 3 |
| Pages (from-to) | 275–294 |
| ISSN | 1571-0661 |
| DOIs | |
| Publication status | Published - 2002 |
| Event | (MTCS 2001) Models for Time-Critical Systems (Satellite Event of CONCUR 2001) - Aalborg, Denmark Duration: 25 Aug 2001 → … |
Conference
| Conference | (MTCS 2001) Models for Time-Critical Systems (Satellite Event of CONCUR 2001) |
|---|---|
| Country | Denmark |
| City | Aalborg |
| Period | 25/08/2001 → … |
Cite this
Buchholtz, M., Andersen, J., & Løvengreen, H. H. (2002). Towards a Process Algebra for Shared Processors. Electronic Notes in Theoretical Computer Science, 52(3), 275–294. https://doi.org/10.1016/S1571-0661(04)00228-2