A Bounded True Concurrency Process Algebra for Performance Evaluation

A True Concurrency Timed Process Algebra which takes into account the number of resources/processors that processes have at disposal is presented. Both its syntax and its operational semantics are defined. An algorithm which allows us to estimate the required time to evolve between states and which allows us to evaluate the performance of a system is also presented. A simple example is used to illustrate how a system can be specified by means of our language and how the performance evaluation algorithm works.

[1]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

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

[3]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

[4]  Valentín Valero Ruiz,et al.  Applying timed-arc Petri nets to improve the performance of the MPEG-2 encoding algorithm , 2004, 10th International Multimedia Modelling Conference, 2004. Proceedings..

[5]  Joost-Pieter Katoen,et al.  Process algebra for performance evaluation , 2002, Theor. Comput. Sci..

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

[7]  Manuel Núñez,et al.  Acceptance Trees for Probabilistic Processes , 1995, CONCUR.

[8]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[9]  Damas P. Gruska.  Bounded Concurrency , 1997, FCT.

[10]  Ness B. Shroff,et al.  Optimal resource allocation in multiclass networks with user-specified utility functions*† , 2001 .

[11]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[12]  Teodor Rus,et al.  Transformation-Based Reactive Systems Development , 1997, Lecture Notes in Computer Science.

[13]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

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

[15]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[16]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[17]  Jan J. M. M. Rutten,et al.  A semantic approach to fairness , 1992, Fundam. Informaticae.

[18]  Gerardo Costa,et al.  Weak and Strong Fairness in CCS , 1987, Inf. Comput..

[19]  Insup Lee,et al.  A process algebraic approach to the specification and analysis of resource-bound real-time systems , 1994, Proc. IEEE.

[20]  Ness B. Shroff,et al.  Optimal resource allocation in multi-class networks with user-specified utility functions , 2002, Comput. Networks.

[21]  David de Frutos-Escrig,et al.  A Sound and Complete Proof System for Probabilistic Processes , 1997, ARTS.

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