PARS: A process Algebra with resources and schedulers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2791, Issue , 2004, Pages 134-150

  Mousavi, Mohammadreza ^a   Reniers, Michel ^a   Basten, Twan ^a   Chaudron, Michel ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; INTERACTIVE COMPUTER SYSTEMS; SCHEDULING; SPECIFICATIONS; TIME SHARING SYSTEMS;

ALGEBRAIC FORMALISMS; ALGEBRAIC SPECIFICATIONS; PROCESS ALGEBRAS; RESOURCE REQUIREMENTS; SCHEDULABILITY ANALYSIS; SCHEDULING STRATEGIES; SCHEDULING THEORY; VERIFICATION PROCESS;

REAL TIME SYSTEMS;

EID: 35048854077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_11     Document Type: Article

References (17)

1. L. Aceto and D. Murphy. Timing and causality in process algebra. Acta. Informatica, 33(4):317-350, 1996.
2. J.C.M. Baeten and C.A. Middelburg. Process Algebra with Timing. EATCS Monographs. Springer-Verlag, Berlin, Germany, 2002.
3. P. Brémond-Grégoire and I. Lee. A process algebra of communicating shared resources with dense time and priorities. Theoretical Computer Science, 189(1-2):179-219, 1997.
4. M. Buchholtz, J. Andersen, and H. H. Loevengreen. Towards a process algebra for shared processors. In Proceedings of MTCS'01, Electronic Notes in Theoretical Computer Science, 52(3), 2002.
5. G.C. Buttazzo. Hard Real-Time Computing Systems. Kluwer Academic Publishers, Boston, MA, USA, 1997.
6. F. Corradini, D. D'Ortenzio, and P. Inverardi. On the relationships among four timed process algebras. Fundamenta Informaticae, 38(4):377-395, 1999.
7. M. Daniels. Modelling real-time behavior with an interval time calculus. In J. Vytopil, editor, Proceedings of FTRTF'91, volume 571 of Lecture Notes in Computer Science, pages 53-71. Springer-Verlag, Berlin, Germany, 1991.
8. J. Davies and S. Schneider. A brief history of Timed CSP. Theoretical Computer Science, 138(2):243-271, Feb. 1995.
9. E. Fersman, P. Pettersson, and W. Yi. Timed automata with asynchronous processes: Schedulability and decidability. In Proceedings of TAC AS 2002, volume 2280 of Lecture Notes in Computer Science, pages 67-82. Springer-Verlag, Berlin, Germany, 2002.
10. A. N. Fredette and R. Cleaveland. RTSL: A language for real-time Schedulability analysis. In Proceedings of the Real-Time Systems Symposium, pages 274-283. IEEE Computer Society Press, Los Alamitos, CA, USA, 1993.
11. P. Gastin and M. W. Mislove. A truly concurrent semantics for a process algebra using resource pomsets. Theoretical Computer Science, 281:369-421, 2002.
12. I. Lee, J.-Y. Choi, H. H. Kwak, A. Philippou, and O. Sokolsky. A family of resource-bound real-time process algebras. In Proceedings of FORTE'01, pages 443-458. Kluwer Academic Publishers, Aug. 2001.
13. I. Lee, A. Philippou, and O. Sokolsky. A general resource framework for real-time systems. In Proceedings of the Monterey Workshop, Venice, Italy, 2002.
14. M. Mousavi, M. Reniers, T. Basten and M. Chaudron. PARS: A process algebra with resource and schedulers. Technical report, Department of Computer Science, Eindhoven University of Technology, 2003. To appear.
15. X. Nicollin and J. Sifakis. The algebra of timed processes ATP: theory and application. Information and Computation, 114(1):131-178, Oct. 1994.
16. M. Núñez and I. Rodríguez. PAMR: A process algebra for the management of resources in concurrent systems. In Proceedings of FORTE'01, pages 169-185. Kluwer Academic Publishers, 2001.
17. R. van Glabbeek and P. Rittgen. Scheduling algebra. In A. M. Haeberer, editor, Proceedings of AMAST'99, volume 1548 of Lecture Notes in Computer Science, pages 278-292. Springer-Verlag, Berlin, Germany, 1999.