Towards a Process Algebra for Shared Processors

Mikael Buchholtz; Jacob Andersen; Hans Henrik Løvengreen

doi:10.1016/S1571-0661(04)00228-2

Towards a Process Algebra for Shared Processors

Mikael Buchholtz, Jacob Andersen, Hans Henrik Løvengreen

Research output: Contribution to journal › Conference article › Research › peer-review

84 Downloads (Pure)

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	https://doi.org/10.1016/S1571-0661(04)00228-2
Publication status	Published - 2002
Event	Models for Time-Critical Systems 2001: Satellite Event of CONCUR 2001 - Aalborg, Denmark Duration: 25 Aug 2001 → 25 Aug 2001

Conference

Conference	Models for Time-Critical Systems 2001
Country/Territory	Denmark
City	Aalborg
Period	25/08/2001 → 25/08/2001

Access to Document

10.1016/S1571-0661(04)00228-2

Imm780

http://www.imm.dtu.dk/pubdb/p.php?780

OpenUrl availability

Full text

Cite this

@inproceedings{9a9537907c144dc7b8fdc488fea35220,

title = "Towards a Process Algebra for Shared Processors",

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.",

author = "Mikael Buchholtz and Jacob Andersen and L{\o}vengreen, {Hans Henrik}",

year = "2002",

doi = "10.1016/S1571-0661(04)00228-2",

language = "English",

volume = "52",

pages = "275–294",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "3",

note = "Models for Time-Critical Systems 2001 : Satellite Event of CONCUR 2001, MTCS 2001 ; Conference date: 25-08-2001 Through 25-08-2001",

}

TY - GEN

T1 - Towards a Process Algebra for Shared Processors

AU - Buchholtz, Mikael

AU - Andersen, Jacob

AU - Løvengreen, Hans Henrik

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

U2 - 10.1016/S1571-0661(04)00228-2

DO - 10.1016/S1571-0661(04)00228-2

M3 - Conference article

SN - 1571-0661

VL - 52

SP - 275

EP - 294

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - 3

T2 - Models for Time-Critical Systems 2001

Y2 - 25 August 2001 through 25 August 2001

ER -

Towards a Process Algebra for Shared Processors

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this