PARS: A Process Algebra with Resources and Schedulers.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

13 Citations (Scopus)


In this paper, we introduce a dense time process algebraic formalism with support for specification of (shared) resource requirements and resource schedulers. The goal of this approach is to facilitate and formalize introduction of scheduling concepts into process algebraic specification using separate specifications for resource requiring processes, schedulers and systems composing the two. The benefits of this research are twofold. Firstly, it allows for formal investigation of scheduling strategies. Secondly, it provides the basis for an extension of schedulability analysis techniques to the formal verification process, facilitating the modelling of real-time systems in a process algebraic manner using the rich background of research in scheduling theory.
Original languageEnglish
Title of host publicationFormal Modeling and Analysis of Timed Systems (First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003, Revised Papers)
EditorsK.G. Larsen, P. Niebert
Place of PublicationBerlin
ISBN (Print)3-540-21671-5
Publication statusPublished - 2004
Eventconference; FORMATS 2003; 2003-09-06; 2003-09-07 -
Duration: 6 Sep 20037 Sep 2003

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conferenceconference; FORMATS 2003; 2003-09-06; 2003-09-07
OtherFORMATS 2003


Dive into the research topics of 'PARS: A Process Algebra with Resources and Schedulers.'. Together they form a unique fingerprint.

Cite this