Abstract
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.
This work has been partially supported by the MCyT project “Description and Performance of Distributed Systems and Application to Multimedia Systems” (Ref. TIC2003-07848-c02-02) and the JCCM project “Design and Implementation of Efficient Multimedia Systems by using Formal Techniques” (Ref. PAC-03001).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. Information and Computation 73, 207–244 (1987)
Rutten, J., Zucker, J.: A Semantics Approach to Fairness. Fundamenta Informaticae XVI, 1–38 (1992)
Reed, G., Roscoe, A.: A Timed Model for Communicating Sequential Processes. Theoretical Computer Science 58, 249–261 (1988)
Moller, F., Tofts, C.: A Temporal Calculus of Communicating Systems. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 401–415. Springer, Heidelberg (1990)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Hermanns, H., Herzog, U., Katoen, J.P.: Process algebra for performance evaluation. Theoretical Computer Science 274, 43–86 (2002)
Giacalone, A., Jou, C.C., Smolka, S.: Algebraic Reasoning for Probabilistic Concurrent Systems. In: Proc. of Working Conference on Programming Concepts and Methods, IFIP TC 2 (1990)
Núñez, M., de Frutos, D., Llana, L.: Acceptance Trees for Probabilistic Processes. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 249–263. Springer, Heidelberg (1995)
Cuartero, F., de Frutos, D., Valero, V.: A sound and complete proof system for probabilistic processes. In: Rus, T., Bertrán, M. (eds.) AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol. 1231, Springer, Heidelberg (1997)
Hoare, C.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Gruska, D.P.: Process Algebra for Limited Parallelism. In: Proc. of Concurrency, Specification and Programming (CS&P 1996), pp. 61–74 (1996)
Gruska, D.P.: Bounded Concurrency. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 198–209. Springer, Heidelberg (1997)
Buchholtz, M., Andersen, J., Løvengreen, H.H.: Towards a Process Algebra for Shared Processors. Electronic Notes in Theoretical Computer Science 52, 145 (2002)
Lee, I., Brémond-Grégoire, P., Gerber, R.: A process algebraic approach to the specification and analysis of resource-bound real-time systems (1994)
Brémond-Grégoire, P., Lee, I.: A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Theoretical Computer Science 189, 179–219 (1997)
Lee, I., Choi, J.Y., Kwak, H.H., Philippou, A., Sokolsky, O.: A Family of Resource-Bound Real-Time Process Algebras. In: Proc. of FORTE 2001, pp. 443–458. Kluwer Academic Publishers, Dordrecht (2001)
Núñez, M., Rodríguez, I.: PAMR: A Process Algebra for the Management of Resources in Concurrent Systems. In: Proc. of FORTE 2001, pp. 169–185. Kluwer Academic Publishers, Dordrecht (2001)
Kalyanasundaram, S., Chong, E., Shroff, N.: Optimal resource allocation in multiclass networks with user-specified utility functions. Computer Networks 38, 613–630 (2002)
Pelayo, F.L., Cuartero, F., Valero, V.: Applying Timed- Arc Petri Nets to Improve the Performance of the MPEG-2 Encoding Algorithm. In: Proc. of the 10th IEEE International Conference on Multi-Media Modelling (MMM 2004), pp. 49–56. IEEE CS, Los Alamitos (2004)
Olivares, T., Quiles, F., Cuenca, P., Orozco, L., Ahmad, I.: Study of Data Distribution Techniques for the Implementation of an MPEG-2 Video Encoder. In: Proc. of the 11th IASTED Int. Conference on Parallel and Distributed Computing Systems (PDCS 1999), pp. 537–542 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruiz, M.C., Cazorla, D., Cuartero, F., Pardo, J.J., Macià, H. (2004). A Bounded True Concurrency Process Algebra for Performance Evaluation. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds) Applying Formal Methods: Testing, Performance, and M/E-Commerce. FORTE 2004. Lecture Notes in Computer Science, vol 3236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30233-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30233-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23169-1
Online ISBN: 978-3-540-30233-9
eBook Packages: Springer Book Archive