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.
- PARS: A Process Algebra with Resources and Schedulers
M.R. Mousavi, M.A. Reniers, T. Basten, M.R.V. Chaudron.
In K.G. Larsen and P. Niebert Formal Modeling and Analysis of Timed Systems, First International Workshop, FORMATS 2003, Proceedings, pages 134-150. Marseille, France, 6-7 September, 2003. Lecture Notes in Computer Science 2791. Springer, Berlin, Germany, 2004. (abstract, ps, pdf).
|
