This Article 
 Bibliographic References 
 Add to: 
Performance Evaluation of Mobile Processes via Abstract Machines
October 2001 (vol. 27 no. 10)
pp. 867-889

Abstract—We use a structural operational semantics which drives us in inferring quantitative measures on system evolution. The transitions of the system are labeled and we assign rates to them by only looking at these labels. The rates reflect the possibly distributed architecture on which applications run. We then map transition systems to Markov chains, and performance evaluation is carried out using standard tools. As a working example, we compare the performance of a conventional uniprocessor with a prefetch pipeline machine. We also consider two case studies from the literature involving mobile computation to show that our framework is feasible.

[1] Netperf: A Network Performance Benchmark, Revision 2.1. Information Networks Division, Hewlett-Packard, 1996.
[2] K. Ahlers, D.E. Breen, C. Crampton, E. Rose, M. Tucheryan, R. Whitaker, and D. Greer, “An Augmented Vision System for Industrial Applications,” Proc. SPIE Photonics for Industrial Applications Conf., Oct. 1994.
[3] A. O. Allen,Probability, Statistics, and Queueing Theory with Computer Science Applications.New York: Academic, 1978.
[4] M. Baldi and G.P. Picco, “Evaluating the Tradeoffs of Mobile Code Design Paradigms in Network Management Applications,” Proc. Conf. Software Eng., pp. 146-155, Apr. 1998.
[5] M. Bernardo, L. Donatiello, and R. Gorrieri, “A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems,” Information and Computation, vol. 144, pp. 83–154, 1998.
[6] G. Berry and L. Cosserat, "The ESTEREL Synchronous Programming Language and Its Mathematical Semantics," Seminar Concurrency, S.D. Brookes, A.W. Roscoe, and G. Winskel, eds., Lecture Notes in Computer Science 197, pp. 389-448. Springer-Verlag, 1985.
[7] R. Borgia, P. Degano, C. Priami, L. Leth, and B. Thomsen, “Understanding Mobile Agents via a Non-Interleaving Semantics for Facile,” Proc. Third Int'l Static Analysis Symp. (SAS '96), R. Cousot and D.A. Schmidt, eds., pp. 98–112, 1996.
[8] G. Boudol and I. Castellani, “A Non-Interleaving Semantics for CCS Based on Proven Transitions,” Fundamenta Informaticae, vol. XI, no. 4, pp. 433–452, 1988.
[9] E. Brinksma, J.-P. Katoen, R. Langerak, and D. Latella, “A Stochastic Causality Based Process Algebra,” The Computer J., vol. 38, no. 6, pp. 552–565, 1995.
[10] L. Brodo, P. Degano, and C. Priami, “A Tool for Quantitative Analysis of$\pi{\hbox{-}}\rm calculus$Processes,” Proc. Eighth Int'l Workshop Process Algebra and Performance Modelling (PAPM '00), 2000.
[11] P. Buchholz, “On a Markovian Process Algebra,” technical report, Informatik IV, Univ. of Dortmund, 1994.
[12] L. Cardelli and A.D. Gordon, "Mobile Ambients," Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, vol. 1378, Springer-Verlag, Berlin, 1998, pp. 140-155.
[13] A. Carzaniga, G.P. Picco, and G. Vigna, "Designing Distributed Applications with Mobile Code Paradigms," Proc. 19th Conf. Software Eng. (ICSE'97), R. Taylor, ed., pp. 22-32, ACM Press, 1997.
[14] P. Cenciarelli, A. Knapp, B. Reus, and M. Wirsing, “An Event-Based Structural Operational Semantics of Multithreaded Java,” Formal Syntax and Semantics of Java, 1998.
[15] M. Chiodo et al., "Hardware/Software Codesign of Embedded Systems," IEEE Micro, Aug. 1994, pp. 26-36.
[16] G. Clark, “Formalising the Specification of Rewards with PEPA,” Proc. Fourth Int'l Workshop Process Algebra and Performance Modelling (PAPM '96), pp. 139–160, 1996.
[17] E. Coste-Maniere and B. Faverjon, “A Programming and Simulation Tool for robotics Workcells,” Proc. Int'l Conf. Automation, Robotics, and Computer Vision, 1990.
[18] L. de Alfaro, “Stochastic Transition Systems,” Proc. Ninth Int'l Conf. Concurrency Theory (CONCUR '98), 1998.
[19] P. Degano, R. De Nicola, and U. Montanari, “Partial Ordering Derivations for CCS,” Proc. Fifth Int'l Conf. Fundamentals of Computation Theory (FCT '85), pp. 520–533, 1985.
[20] P. Degano and R. Gorrieri, “A Causal Semantics of Action Refinement,” Information and Computation, vol. 122, no. 1, pp. 97–121, 1995.
[21] P. Degano and C. Priami, “Proved Trees,” Proc. 19th Int'l Colloquium Automata, Languages, and Programming (ICALP '92), pp. 629–640, 1992.
[22] P. Degano and C. Priami, “Enhanced Operational Semantics,” ACM Computing Surveys, vol. 28, no. 2, pp. 352–354, 1996.
[23] P. Degano and C. Priami, “Non Interleaving Semantics for Mobile Processes,” Theoretical Computer Science, vol. 216, pp. 237–270, 1999.
[24] P. Degano, C. Priami, L. Leth, and B. Thomsen, “Causality for Debugging Mobile Agents,” Acta Informatica, 1999.
[25] D.L. Eager, E.D. Lazowska, and J. Zahorjan, "Adaptive Load Sharing in Homogeneous Distributed Systems," IEEE Trans. Software Eng., vol. 12, no. 5, pp. 662-675, May 1986.
[26] W. Feller, An Introduction to Probability Theory and its Applications. Wiley, 1970.
[27] C. Fournet and G. Gonthier, “The Reflexive Chemical Abstract Machine and the Join-Calculus,” Proc. ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages (POPL '96), pp. 372-385, 1996.
[28] C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy, "A Calculus of Mobile Agents," Proc. Int'l Conf. Concurrency Theory. Lecture Notes in Computer Science 1,119, pp. 406-421. Springer-Verlag, 1996.
[29] A. Fuggetta, G. Picco, and G. Vigna, "Understanding Code Mobility," IEEE Trans. Software Eng., May 1998, pp. 352-361.
[30] N. Götz, U. Herzog, and M. Rettelbach, “TIPP—A Language for Timed Processes and Performance Evaluation,” Technical Report 4/92, IMMD VII, Univ. of Erlangen-Nurnberg, 1992.
[31] R. Want et al., "The Active Badge Location System," ACM Trans. Information Systems, vol. 10, no. 1, Jan. 1992, pp. 91-102.
[32] P.G. Harrison and B. Strulo, “Stochastic Process Algebra for Discrete Event Simulation,” Quantitative Methods in Parallel Systems, pp. 18–37, 1995.
[33] C. Harvey, “Performance Engineering as an Integral Part of System Design,” BT Technology J., vol. 4, no. 3, pp. 143–147, 1986.
[34] O.M. Herescu and C. Palamidessi, “Probabilistic Asynchronous$\pi{\hbox{-}}\rm calculus$,” Proc. Third Int'l Conf. Foundations of Software Science and Computation Structure (FOSSACS '2000), pp. 146–210, 2000.
[35] H. Hermanns, U. Herzog, and V. Mertsiotakis, “Stochastic Process Algebras—between LOTOS and Markov Chains,” Computer Networks and ISDN Systems, vol. 30, nos. 9-10, pp. 901–924, 1998.
[36] J. Hillston, A Compositional Approach to Performance Modelling. Cambridge Univ. Press, 1996.
[37] C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, Englewood Cliffs, N.J., 1985.
[38] R. Howard, Dynamic Probabilistic Systems: Semi-Markov and Decision Systems, volume II.Wiley, 1971.
[39] O.C. Ibe and K.S. Trivedi, “Stochastic Petri Net Models of Polling Systems,” IEEE J. Selected Areas of Comm., vol. 8, no. 9, 1990.
[40] L.J. Jagadeesan, C. Puchol, and J.E. Von Olnhausen, “A Formal Approach to Reactive Systems Software: A Telecommunications Application in Esterel,” Proc. Workshop Industrial-Strength Formal Specification Techniques, 1995.
[41] C. B. Jones,Systematic Software Development Using VDM. Englewood Cliffs, NJ: Prentice-Hall, 1990, 2nd ed.
[42] K.G. Larsen and A. Skou, “Compositional Verification of Probabilistic Processes,” Proc. Third Int'l Conf. Concurrency Theory (CONCUR '92), 1992.
[43] A. Maggiolo-Schettini and S. Tini, “Applying Techniques of Asynchronous Concurrency to Synchronous Languages,” Fundamenta Informaticae, vol. 40, pp. 221–250, 1999.
[44] M.Ajmone Marsan,S. Donatelli,F. Neri,, and U. Rubino,“On the construction of abstract GSPNs: Anexercise in modeling,” Proc. Fourth Int’l Workshop Petri Nets and Performance Models, pp. 2-17,Melbourne, Australia, Dec.2-5, 1991.
[45] R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, N.J., 1989.
[46] R. Milner, Communicating and Mobile Systems: The p calculus, Cambridge Univ. Press, Cambridge, UK, 1999.
[47] R. Milner, J. Parrow, and D. Walker, “A Calculus of Mobile Processes,” Information and Computation, vol. 100, pp. 1-77, 1992.
[48] R. Milner, J. Parrow, and D. Walker, “Modal Logics for Mobile Processes,” Theoretical Computer Science, vol. 114, pp. 149–171, 1993.
[49] D.S. Milojicic, F. Douglis, Y. Paindaveine, R. Wheeler, and S. Zhou, “Process Migration,” technical report, HP Labs, 1998.
[50] G. Murakami and R. Sethi, “Terminal Call Processing in Esterel,” Proc. IFIP 92 World Computer Congress, 1992.
[51] R. Nelson, Probability, Stochastic Processes, and Queueing Theory. New York: Springer-Verlag, 1995.
[52] X. Nicollin and J. Sifakis, “An Overview and Synthesis on Timed Process Algebras,” Real Time: Theory in Practice, pp. 526–548, 1991.
[53] F. Nielson and H.R. Nielson, “From CML to Its Process Algebra,” Theoretical Computer Science, vol. 155, pp. 179–219, 1996.
[54] B.C. Pierce and D.N. Turner, “Pict: A Programming Language Based on the Pi-Calculus,” Technical Report CSCI 476, Computer Science Dept., Indiana Univ., 1997. To appear Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, eds., MIT Press, 1998.
[55] G. Plotkin, “A Structural Approach to Operational Semantics,” Technical Report DAIMI FN-19, Aarhus Univ., Denmark 1981.
[56] C. Priami, “Stochastic$\pi{\hbox{-}}\rm calculus$,” The Computer J., vol. 38, no. 6, pp. 578–589, 1995.
[57] C. Priami, “Stochastic$\pi{\hbox{-}}\rm calculus$with General Distributions,” Proc. Fourth Int'l Workshop Process Algebra and Performance Modelling (PAPM '96), pp. 41–57, 1996.
[58] A. Reibman, R. Smith, and K. Trivedi, “Markov and Markov Reward Model Transient Analysis: An Overview of Numerical Approaches,” European J. Operations Research, vol. 40, pp. 257–267, 1989.
[59] J. Riely and M. Hennessy, “A Typed Language for Distributed Mobile Processes,” Proc. 25th ACM Principles of Programming Languages (POPL '98), pp. 378–390 1998.
[60] D. Sangiorgi, “Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms,” PhD thesis, Univ. of Edinburgh, 1992.
[61] W.J. Stewart, Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.
[62] J.-P. Talpin, “The Calumet Experiment in Facile—A Model for Group Communication and Interaction Control in Cooperative Applications,” Technical Report ECRC-94-26, European Computer-Industry Research Centre, 1994.
[63] J.-P. Talpin, P. Marchal, and K. Ahlers, “Calumet—A Reference Manual,” Technical Report ECRC-94-30, European Computer-Industry Research Centre, 1994.
[64] B. Thomsen, “Plain CHOCS: A Second Generation Calculus for Higher Order Processes,” Acta Informatica, vol. 30, no. 1, pp. 1–59, 1993.
[65] B. Thomsen, L. Leth, S. Prasad, T.-M. Kuo, A. Kramer, F. Knabe, and A. Giacalone, “Facile Antigua Release Programming Guide,” Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993.
[66] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[67] R.J. van Glabbeek, S.A. Smolka, B. Steffen, and C.M.N. Tofts, “Reactive, Generative and Stratified Models of Probabilistic Processes,” Information and Computation, 1995.

Index Terms:
Calculi for mobility, enhanced operational semantics, formal methodology, performance evaluation, stochastic models.
Chiara Nottegar, Corrado Priami, Pierpaolo Degano, "Performance Evaluation of Mobile Processes via Abstract Machines," IEEE Transactions on Software Engineering, vol. 27, no. 10, pp. 867-889, Oct. 2001, doi:10.1109/32.962559
Usage of this product signifies your acceptance of the Terms of Use.