Skip to main content
SpringerLink
Log in

PARS: A Process Algebra with Resources and Schedulers

  • Conference paper
Formal Modeling and Analysis of Timed Systems (FORMATS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2791))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L., Murphy, D.: Timing and causality in process algebra. Acta Informatica 33(4), 317–350 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. EATCS Monographs. Springer, Berlin (2002)

    MATH  Google Scholar 

  3. Brémond-Grégoire, P., Lee, I.: A process algebra of communicating shared resources with dense time and priorities. Theoretical Computer Science 189(1-2), 179–219 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Buchholtz, M., Andersen, J., Loevengreen, H.H.: Towards a process algebra for shared processors. In: Proceedings of MTCS 2001. Electronic Notes in Theoretical Computer Science, vol. 52(3) (2002)

    Google Scholar 

  5. Buttazzo, G.C.: Hard Real-Time Computing Systems. Kluwer Academic Publishers, Boston (1997)

    MATH  Google Scholar 

  6. Corradini, F., D’Ortenzio, D., Inverardi, P.: On the relationships among four timed process algebras. Fundamenta Informaticae 38(4), 377–395 (1999)

    MATH  MathSciNet  Google Scholar 

  7. Daniels, M.: Modelling real-time behavior with an interval time calculus. In: Vytopil, J. (ed.) FTRTFT 1992. LNCS, vol. 571, pp. 53–71. Springer, Heidelberg (1991)

    Google Scholar 

  8. Davies, J., Schneider, S.: A brief history of Timed CSP. Theoretical Computer Science 138(2), 243–271 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fersman, E., Pettersson, P., Yi, W.: Timed automata with asynchronous processes: Schedulability and decidability. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 67–82. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Fredette, A.N., Cleaveland, R.: RTSL: A language for real-time schedulability analysis. In: Proceedings of the Real-Time Systems Symposium, pp. 274–283. IEEE Computer Society Press, Los Alamitos (1993)

    Chapter  Google Scholar 

  11. Gastin, P., Mislove, M.W.: A truly concurrent semantics for a process algebra using resource pomsets. Theoretical Computer Science 281, 369–421 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lee, I., Choi, J.-Y., Kwak, H.H., Philippou, A., Sokolsky, O.: A family of resource-bound real-time process algebras. In: Proceedings of FORTE 2001, pp. 443–458. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  13. Lee, I., Philippou, A., Sokolsky, O.: A general resource framework for real-time systems. In: Proceedings of the Monterey Workshop, Venice, Italy (2002)

    Google Scholar 

  14. Mousavi, M., Reniers, M., Basten, T., Chaudron, M.: PARS: A process algebra with resource and schedulers. Technical report, Department of Computer Science, Eindhoven University of Technology (2003) (to appear)

    Google Scholar 

  15. Nicollin, X., Sifakis, J.: The algebra of timed processes ATP: theory and application. Information and Computation 114(1), 131–178 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  16. Núñez, M., Rodríguez, I.: PAMR: A process algebra for the management of resources in concurrent systems. In: Proceedings of FORTE 2001, pp. 169–185. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  17. van Glabbeek, R., Rittgen, P.: Scheduling algebra. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 278–292. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eindhoven University of Technology, Post Box 513, NL-5600 MB, Eindhoven, The Netherlands

    MohammadReza Mousavi, Michel Reniers, Twan Basten & Michel Chaudron

Authors
  1. MohammadReza Mousavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Reniers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Twan Basten
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michel Chaudron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Aalborg University, Denmark

    Kim Guldstrand Larsen

  2. Laboratoire d’Informatique Fondamentale de Marseille, CMI, 39, rue Joliot Curie, 13453, Marseille Cedex 13, France

    Peter Niebert

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mousavi, M., Reniers, M., Basten, T., Chaudron, M. (2004). PARS: A Process Algebra with Resources and Schedulers. In: Larsen, K.G., Niebert, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2003. Lecture Notes in Computer Science, vol 2791. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40903-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40903-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21671-1

  • Online ISBN: 978-3-540-40903-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation