Towards a Process Algebra for Shared Processors

Mikael Buchholtz, Jacob Andersen, Hans Henrik Løvengreen

    Research output: Contribution to journalConference articleResearchpeer-review

    68 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 languageEnglish
    JournalElectronic Notes in Theoretical Computer Science
    Volume52
    Issue number3
    Pages (from-to)275–294
    ISSN1571-0661
    DOIs
    Publication statusPublished - 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)
    CountryDenmark
    CityAalborg
    Period25/08/2001 → …

    Cite this