Abstract
In this paper we introduce time information in PAMR (Process Algebra for the Management of Resources). PAMR is a process algebra that simplifies the task of specifying processes whose behavior strongly depend on the resources that they have. One of the drawbacks of PAMR is that there is not an appropriate notion of time. In this paper we will consider that the duration of actions is controlled by a random variable. These random variables will take values, according to some probability distribution functions, that may depend, in particular, on the available resources. We present two examples showing the main features of our stochastic version of PAMR.
Research partially supported by the Spanish MEC project WEST/FAST TIN2006-15578-C02-01 and the Marie Curie RTN TAROT (MRTN-CT-2003-505121).
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
Marsan, M.A., Bianco, A., Ciminiera, L., Sisto, R., Valenzano, A.: A LOTOS extension for the performance analysis of distributed systems. IEEE/ACM Transactions on Networking 2(2), 151–165 (1994)
Arrow, K.J.: Social Choice and Individual Values, 2nd edn. Wiley, Chichester (1963)
Bernardo, M., Gorrieri, R.: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science 202(1-2), 1–54 (1998)
Bravetti, M., D’Argenio, P.R.: Tutte le algebre insieme: Concepts, discussions and relations of stochastic process algebras with general distributions. In: Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 44–88. Springer, Heidelberg (2004)
Bravetti, M., Gorrieri, R.: The theory of interactive generalized semi-Markov processes. Theoretical Computer Science 282(1), 5–32 (2002)
D’Argenio, P.R., Katoen, J.-P.: A theory of stochastic systems part I: Stochastic automata. Information and Computation 203(1), 1–38 (2005)
D’Argenio, P.R., Katoen, J.-P.: A theory of stochastic systems part II: Process algebra. Information and Computation 203(1), 39–74 (2005)
Götz, N., Herzog, U., Rettelbach, M.: Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras. In: Donatiello, L., Nelson, R. (eds.) SIGMETRICS 1993 and Performance 1993. LNCS, vol. 729, pp. 121–146. Springer, Heidelberg (1993)
Harrison, P.G., Strulo, B.: SPADES – a process algebra for discrete event simulation. Journal of Logic Computation 10(1), 3–42 (2000)
Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation. Theoretical Computer Science 274(1-2), 43–87 (2002)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Infante López, G.G., Hermanns, H., Katoen, J.-P.: Beyond memoryless distributions: Model checking semi-Markov chains. In: de Luca, L., Gilmore, S.T. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 57–70. Springer, Heidelberg (2001)
López, N., Núñez, M.: A testing theory for generally distributed stochastic processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 321–335. Springer, Heidelberg (2001)
López, N., Núñez, M.: Weak stochastic bisimulation for non-markovian processes. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 454–468. Springer, Heidelberg (2005)
López, N., Núñez, M., Rubio, F.: An integrated framework for the analysis of asynchronous communicating stochastic processes. Formal Aspects of Computing 16(3), 238–262 (2004)
Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: 6th ACM Symp. on Principles of Distributed Computing, PODC 1987, pp. 137–151. ACM Press, New York (1987)
Merayo, M.G., Núñez, M., Rodríguez, I.: Formal specification of multi-agent systems by using EUSMs. In: FSEN’07. 2nd IPM Int. Symposium on Fundamentals of Software Engineering. LNCS (to appear, 2007)
Núñez, M., Rodríguez, I.: PAMR: A process algebra for the management of resources in concurrent systems. In: FORTE 2001. 21st IFIP WG 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems, pp. 169–185. Kluwer Academic Publishers, Dordrecht (2001)
Núñez, M., Rodríguez, I.: Encoding PAMR into (timed) EFSMs. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 1–16. Springer, Heidelberg (2002)
Núñez, M., Rodríguez, I., Rubio, F.: Formal specification of multi-agent e-barter systems. Science of Computer Programming 57(2), 187–216 (2005)
Núñez, M., Rodríguez, I., Rubio, F.: Specification and testing of autonomous agents in e-commerce systems. Software Testing, Verification and Reliability 15(4), 211–233 (2005)
Sen, K., Viswanathan, M., Agha, G.: On statistical model checking of stochastic games. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 266–280. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, N., Núñez, M., Rodríguez, I. (2007). SPAMR: Extending PAMR with Stochastic Time. In: Wolter, K. (eds) Formal Methods and Stochastic Models for Performance Evaluation. EPEW 2007. Lecture Notes in Computer Science, vol 4748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75211-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-75211-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75210-3
Online ISBN: 978-3-540-75211-0
eBook Packages: Computer ScienceComputer Science (R0)