PARS: A Process Algebra with Resources and Schedulers

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.

[1]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

[2]  Manuel Núñez,et al.  PAMR: A Process Algebra for the Management of Resources in Concurrent Systems , 2001, FORTE.

[3]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[4]  Mats Daniels,et al.  Modelling Real-Time Behaviour with an Interval Time Calculus , 1992, FTRTFT.

[5]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[6]  Rob J. van Glabbeek,et al.  Scheduling Algebra , 1998, AMAST.

[7]  Insup Lee,et al.  A General Resource Framework for Real-Time Systems , 2002, RISSEF.

[8]  Mikael Buchholtz,et al.  Towards a Process Algebra for Shared Processors , 2002, MTCS.

[9]  Paola Inverardi,et al.  On the Relationships among four Timed Process Algebras , 1999, Fundam. Informaticae.

[10]  Paul Gastin,et al.  A truly concurrent semantics for a process algebra using resource pomsets , 2002, Theor. Comput. Sci..

[11]  Jim Davies,et al.  A Brief History of Timed CSP , 1995, Theor. Comput. Sci..

[12]  Insup Lee,et al.  A Process Algebra of Communicating Shared Resources with Dense Time and Priorities , 1997, Theor. Comput. Sci..

[13]  Insup Lee,et al.  A Family of Resource-Bound Real-Time Process Algebras , 2001 .

[14]  Rance Cleaveland,et al.  RTSL: a language for real-time schedulability analysis , 1993, 1993 Proceedings Real-Time Systems Symposium.

[15]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[16]  Wang Yi,et al.  Timed Automata with Asynchronous Processes: Schedulability and Decidability , 2002, TACAS.

[17]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.