Towards a Process Algebra for Shared Processors |
|
| Abstract | We present work-in-progress on a timed process algebra that models sharing of processor resources allowing preemption at arbitrary points of 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. |
| Type | Journal paper [With referee] |
| Journal | Electronic Notes in Theoretical Computer Science |
| Editors | Flavio Corradini and Walter Vogler |
| Year | 2002 Vol. 52 No. 3 |
| Publisher | Elsevier Science Publishers |
| Electronic version(s) | [ps] |
| BibTeX data | [bibtex] |
| IMM Group(s) | Computer Science & Engineering |