Language-based performance prediction for distributed and mobile systems

Information and Computation

Volumn 175, Issue 2, 2002, Pages 119-145

  Priami, Corrado ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

General distributions; Operational semantics; Performance prediction; Proved transition system; Stochastic process algebra

Indexed keywords

ALGEBRA; DISTRIBUTED COMPUTER SYSTEMS; ENCODING (SYMBOLS); MOBILE TELECOMMUNICATION SYSTEMS; PERFORMANCE; RANDOM PROCESSES; SEMANTICS;

MOBILE SYSTEMS;

INFORMATION SCIENCE;

EID: 0037098847     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.3058     Document Type: Article

References (53)

1. Ajmone Marsan, M., Balbo, G., Bobbio, A., Chiola, G., Conte, G., and Cumani, A. (1989), The effect of execution policies on the semantics and analysis of stochastic Petri nets, IEEE Trans. Software Eng. 15, 832-846.
2. Ajmone Marsan, M., Bianco, A., Ciminiera, L., Sisto, R., and Valenzano, A (1994), A LOTOS extension for the performance analysis of distributed systems, IEEE/ACM Trans. Networking 2, 151-164.
3. Baldi, M., and Picco, G. P. (1998), Evaluating the tradeoffs of mobile code design paradigms in network management applications, in "Proceedings of ICSE'98," Assoc. Comput. Mach., New York.
4. Bernardo, M., Donatiello L., and Gorrieri, R. (1998), A formal approach to the integration of performance aspects in the modelling and analysis of concurrent systems, Inform. and Comput. 144, 83-154.
5. Boreale, M., and Sangiorgi, D. (1998), Some congruence properties for π-calculus bisimilarities, Theoret. Comput. Sci. 198.
6. Boudol, G., and Castellani, I. (1988), A non-interleaving semantics for CCS based on proved transitions, Fund. Inform. XI, 433-452.
7. Bravetti, M., Bernardo, M., and Gorrieri, R. (1998), Towards performance evaluation with general distributions in process algebra, in "Proceedings of CONCUR'98", Lecture Notes in Computer Science, Vol. 1466, pp. 405-422, Springer-Verlag.Berlin/New York.
8. Bravetti, M., and Gorrieri, R. (1999), Interactive generalized semi-Markov processes, in "Proceedings of PAPM'99."
9. Brinksma, E., Katoen, J.-P., Langerak, R., and Latella, D. (1995), A stochastic causality based process algebra, Comput. J. 38, 552-565.
10. Brodo, L., Degano, P., and Priami, C. (2000), A tool for quantitative analysis of π-calculus processes, in "Proceedings of PAPM'00," Carleton Scientific, Geneva.
11. Buchholz, P. (1994), "On a Markovian Process Algebra," Technical Report 500, Informatik IV, University of Dortmund.
12. Cardelli, L., and Gordon, A. (1998), Mobile ambients, in "Proceedings of FoSSaCS'98," Lecture Notes in Computer Science, VoL 1378, pp. 140-155, Springer-Verlag, Berlin.
13. Carzaniga, A., Picco, G. P., and Vigna, G. (1997), Designing distributed applications with mobile code paradigms, in "Proceedings of ICSE'97," pp. 23-32, Assoc. Comput. Mach., New York.
14. Cleaveland, R. (1996), Position statement of the concurrency working group, in "Proceedings of ACM Workshop on Strategic Directions in Computing Research," Assoc. Comput. Mach., New York.
15. D'Argenio, P. R. (1999), "Algebras and Automata for Timed and Stochastic Systems," Ph.D. thesis, University of Twente.
16. D'Argenio, P. R., Katoen, J.-P., and Brinksma, E. (1998), An algebraic approach to the specification of stochastic systems, in "Proceedings of PROCOMET'98," IFIP Series, pp. 126-147, Chapman & Hall, London/New York.
17. Degano, P., De Nicola, R., and Montanari, U. (1985), Partial ordering derivations for CCS, in "Proceedings of FCT'85," Lecture Notes Computer Science, Vol. 199. pp. 520-533, Springer-Verlag, Berlin.
18. Degano, P., and Priami, C. (1992), Proved trees, in "Proceedings of ICALP'92," Lecture Notes in Computer Science, Vol. 623, pp. 629-640, Springer-Verlag, Berlin.
19. Degano, P., and Priami, C. (1996), Enhanced operational semantics, ACM Comput. Surveys 28, 352-354.
20. Degano, P., and Priami, C. (1999), Non interleaving semantics for mobile processes, Theoret. Comput. Sci. 216, 237-270.
21. Degano, P., Priami, C., Leth, L., and Thomsen, B. (1999), Causality for debugging mobile agents, Acta Inform. 36, 335-374.
22. Fournet, C., Gonthier, G., Levy, J.-J. Maranget, L., and Remy, D. (1996), A calculus of mobile agents, in "Proceedings of CONCUR'96," Lecture Notes in Computer Science, Vol. 1119, pp. 406-421, Springer-Verlag, Berlin.
23. Giacalone, A., Mishra, P., and Prasad, S. (1989), Facile: A symmetric integration of concurrent and functional programming, Internat. J. Parallel Programming 18, 121-160.
24. Götz, N., Herzog, U., and Rettelbach, M. (1992), "TIPP-A Language for Timed Processes and Performance Evaluation," Technical Report 4/92, IMMD VII, University of Erlangen-Numberg.
25. Götz, N., Herzog, U., and Rettelbach, M. (1993), TIPP-Introduction and application to protocol performance analysis, in "Formale Beshreibungstechniken für verteilte Systeme," FOKUS series, Saur Publishers, Munich.
26. Hansson, H., and Jonsson, B. (1990), A calculus of communicating systems with time and probability, in "Proceedings of IEEE RTSS'90, Orlando, Florida."
27. Harrison, P. G., and Strulo, B. (1995), Stochastic process algebra for discrete event simulation, "Quantitative Methods in Parallel Systems," pp. 18-37.
28. Hermanns, H., Herzog, U., and Mertsiotakis, V. (1998), Stochastic process algebras-between LOTOS and Markov chains, Comput. Networks and ISDN System 30, 901-924.
29. Herzog, U. (1996), "A concept for graph-based process algebras, generally distributed activity times and hierarchical modelling, in "Proceedings of PAPM'96" pp. 1-20. CLUT, Torino.
30. Hillston, J. (1996), "A Compositional Approach to Performance Modelling," Cambridge Univ. Press, Cambridge, UK.
31. Katoen, J.-P., (1996), "Quantitative and Qualitative Extensions of Event Structures," Ph.D. thesis, Center for Telematics and Information Technology, University of Twente. Available as CTIT No. 96-09.
32. Kemeny, J. G., and Snell, J. L. (1960), "Finite Markov Chains," Van Nostrand, Princeton, NJ.
33. Larsen, K. G., and Skou, A. (1992), Compositional verification of probabilistic processes, in "Proceedings of CONCUR'92," Lecture Notes in Computer Science, Vol. 630, Springer-Verlag, Berlin.
34. Maggiolo-Schettini, A., and Tini, S. (1999), Applying techniques of asynchronous concurrency to synchronous languages, Fund. Inform. 40, 221-250.
35. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, London.
36. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, I, II, Inform. and Comput. 100, 1-77.
37. Milner, R., Parrow, J., and Walker, D. (1993), Modal logics for mobile processes, Theoret. Comput. Sci. 114, 149-171.
38. Nicollin, X., and Sifakis, J. (1991), Au overview and synthesis on timed process algebras, "Real Time: Theory in Practice," Lecture Notes in Computer Science, Vol. 600, 526-548, Springer-Verlag, Berlin.
39. Nielson, F., and Nielson, H. R. (1996), From CML to its process algebra, Theoret. Comput. Sci. 155, 179-219.
40. Nottegar, C., Priami, C., and Degano, P. (2001), Performance evaluation of mobile processes via abstract machines, IEEE TSE 27, 867-889.
41. Nottegar, C., Priami, C., and Degano. P. (1999), Semantic-driven performance evaluation, in "Proceedings of FASE'99" Lecture Notes in Computer Science, Vol. 1577, pp. 204-218, Springer-Verlag, Berlin.
42. Pierce, B. C., and Turner, D. N. (1999), PICT: A programming language based on the pi-calculus, in "Proof, Language and Interaction: Essays in Honour of Robin Milner," MIT Press, Cambridge, MA.
43. Plotkin, G. (1981), "A Structural Approach to Operational Semantics," Technical Report DAIMI FN-19, Aarhus University, Denmark.
44. Priami, C. (1995), Stochastic π-calculus. Comput. J. 38, 578-589.
45. Priami, C. (1996), Integrating behavioural and performance analysis with topology information, in "Proceedings of 29th Hawaian International Conference on System Sciences, Maui, Hawaii," Vol. 1, pp. 508-516, IEEE Press, New York.
46. Priami, C. (1996), Stochastic π-calculus with general distributions, in "Proceedings of PAPM'96," pp. 41-57, CLUT, Torino.
47. Priami, C. (1998), Enabling and general distributions in stochastic process algebras, in "Proceedings of Italian Conference on Theoretical Computer Science, Prato," pp. 192-203, World Scientific, Singapore.
48. Priami, C., Regev, A., Shapiro, U., and Silverman, W. (2001), Application of a stochastic name-parsing calculus to representation and simulation of molecular processes, Inf. Process. Lett. 80, 25-31.
49. Regev, A., Priami, C., Silverman, W., and Shapiro, U. Stochastic process algebras for the modeling of biomolecular processes. submitted for publication.
50. Riely, J., and Hennessy, M. (1998), A typed language for distributed mobile processes, in "Proceedings of POPL'98" pp. 378-390.
51. Sangiorgi, D. (1992), "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis, University of Edinburgh.
52. Thomsen, B. (1993), Plain CHOCS: a second generation calculus for higher order processes, Acta Inform. 30, 1-59.
53. van Glabbeek, R. J., Smolka, S. A., and Steffen, B. (1995), Reactive, generative and stratified models of probabilistic processes, Inform. and Comput. 121, 59-80.