Work

Towards a Process Algebra for Shared Processors

Year: 2002

Type: article

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.

Source: Electronic Notes in Theoretical Computer Science

DOI: 10.1016/s1571-0661(04)00228-2

Authors: Mikael Buchholtz, Jacob Andersen, Hans Henrik Løvengreen

Institution: Technical University of Denmark

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2008753764

FWCI: 1.667

Cites: 19

Cited by: 10

Related to: 10