A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time

Theoretical Computer Science

Volumn 202, Issue 1-2, 1998, Pages 1-54

  Bernardo, Marco ^a   Gorrieri, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Bisimulation equivalence; Markov chain; Priority; Probability; Process algebra

Indexed keywords

EID: 0001990888     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00127-8     Document Type: Review

References (60)

1. M. Ajmone Marsan, G. Balbo, G. Conte, A class of generalized stochastic petri nets for the performance evaluation of multiprocessor systems, ACM Trans. Comput. Syst. 2 (1984) 143-172.
2. M. Ajmone Marsan, A. Bianco, L. Ciminiera, R. Sisto, A. Valenzano, A LOTOS extension for the performance analysis of distributed systems, IEEE/ACM Trans. Networking 2 (1994) 151-164.
3. J.C.M. Baeten, J.A. Bergstra, Real time process algebra, Formal Aspects Comput. 3 (1991) 142-188.
4. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform. IX (1986) 127-168.
5. J.C.M. Baeten, J.A. Bergstra, S.A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Inform. Comput. 121 (1995) 234-255.
6. J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication. Inform. and Control 60 (1984) 109-137.
7. M. Bernardo, On the coexistence of exponential, immediate and passive actions in EMPA, in: [53], pp. 58-76.
8. M. Bernardo, L. Donatiello, R. Gorrieri, Integrating Performance and Functional Analysis of Concurrent Systems with EMPA, Technical Report UBLCS-95-14, University of Bologna, Italy, 1995.
9. M. Bernardo, R. Gorrieri, Extended Markovian Process Algebra, Proc. 7th Int. Conf. Concurrency Theory (CONCUR '96), Pisa, Italy, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 315-330.
10. T. Bolognesi, E. Brinksma, Introduction to the ISO specification language LOTOS, Comput. Networks and ISDN Systems 14 (1987) 25-59.
11. E. Brinksma, J.-P. Katoen, R. Langerak, D. Latella, A stochastic causality-based process algebra, in: [18], pp. 553-565.
12. P. Buchholz, Markovian process algebra: Composition and equivalence, in: [28], pp. 11-30.
13. J. Camilleri, G. Winskel, CCS with priority choice, Inform. and Comput. 116 (1995) 26-37.
14. R. Cleaveland, M. Hennessy, Priorities in process algebras, Inform. and Comput. 87 (1990) 58-77.
15. R. Cleaveland, G. Lüttgen, V. Natarajan, A process algebra with distributed priorities, Proc. 7th Int. Conf. Concurrency Theory (CONCUR '96), Pisa, Italy, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 34-49.
16. J.-C. Fernandez, An Implementation of an efficient algorithm for bisimulation equivalence, Sci. Comput. Programming 13 (1989) 219-236.
17. R. Gerber, I. Lee, A resource-based prioritized bisimulation for real-time systems, Inform. and Comput. 113 (1994) 102-142.
18. S. Gilmore, J. Hillston (Eds.), Proc. of the 3rd Workshop on Process Algebras and Performance Modelling (PAPM '95), Comput. J. 38(7), Edinburgh, UK, 1995.
19. R. van Glabbeek, S.A. Smolka, B. Steffen, Reactive, generative and stratified models of probabilistic processes, Inform. and Comput. 121 (1995) 59-80.
20. R. Gorrieri, M. Roccetti, E. Stancampiano, A theory of processes with durational actions, Theoret. Comput. Sci. 140 (1995) 73-94.
21. H. Hansson, B. Jonsson, A calculus for communicating systems with time and probabilities, Proc. 11th Real-Time Systems Symp. (RTSS '90), IEEE-Computer Society Press, Orlando, FL, 1990.
22. P.G. Harrison, B. Strulo, Stochastic Process Algebra for Discrete Event Simulation, in: Quantitative Methods in Parallel Systems, Springer, Berlin, 1995, pp. 18-37.
23. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
24. M. Hennessy, T. Regan, A process algebra for timed systems, Inform. and Comput. 117 (1995) 221-239.
25. H. Hermanns, M. Rettelbach, Syntax, semantics, equivalences, and axioms for MTIPP, in: [28], pp. 71-87.
26. H. Hermanns, M. Rettelbach, Towards a Superset of Basic LOTOS for Performance Prediction, in: [53], pp. 77-94.
27. H. Hermanns, M. Rettelbach, T. Weiß, Formal characterisation of immediate actions in SPA with nondeterministic branching, in: [18], pp. 530-541.
28. U. Herzog, M. Rettelbach (Eds.), Proc. 2nd Workshop on Process Algebras and Performance Modelling (PAPM '94), Erlangen, Germany, 1994.
29. J. Hillston, A Compositional Approach to Performance Modelling, Cambridge Univ. Press, Cambridge, 1996.
30. J. Hillston, The Nature of synchronisation, in: [28], pp. 51-70.
31. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.
32. C.-C. Jou, S.A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, Proc. 1st Int. Conf. on Concurrency Theory (CONCUR '90), Amsterdam, The Netherlands, Lecture Notes in Computer Science, vol. 458, Springer, Berlin, 1990, pp. 367-383.
33. J.-P. Katoen, E. Brinksma, R. Langerak, D. Latella, Stochastic simulation of event structures, in: [53], pp. 21-40.
34. L. Kleinrock, Queueing Systems, Wiley, New York, 1975.
35. K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, Inform. and Comput. 94 (1991) 1-28.
36. K.G. Larsen, A. Skou, Compositional verification of probabilistic processes, Proc. 3rd Int. Conf. Concurrency Theory (CONCUR '92), Stony Brook, NY, Lecture Notes in Computer Science, vol. 630, Springer, Berlin, 1992, pp. 456-471.
37. D. Lehmann, M. Rabin, On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem, in Proc. 8th Symp. on Principles of Programming Languages (POPL '81), ACM Press, New York, 1981, pp. 133-138.
38. G. Lowe, Probabilistic and prioritized models of timed CSP, Theoret. Comput. Sci. 138 (1995) 315-352.
39. C. Miguel, A. Fernandez, L. Vidaller, LOTOS extended with probabilistic behaviours, Formal Aspects Comput. 5 (1993) 253-281.
40. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989
41. F. Moller, C. Tofts, A Temporal Calculus of Communicating Systems, Proc. 1st Int. Conf. on Concurrency Theory (CONCUR '90), Amsterdam, The Netherlands, Lecture Notes in Computer Science, vol. 458, Springer, Berlin, 1990, pp. 401-415.
42. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach, John Hopkins Univ. Press, Baltimore City, 1981.
43. X. Nicollin, J. Sifakis, The algebra of timed processes ATP: Theory and application, Inform. and Comput. 114 (1994) 131-178.
44. N. Nounou, Y. Yemini, Algebraic specification-based performance analysis of communication protocols, Proc. 5th Int. Conf. Protocol Specification, Testing and Verification (PSTV V), North-Holland, Amsterdam, 1985, pp. 541-560.
45. R. Paige, R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (1987) 973-989.
46. D. Park, Concurrency and automata on infinite sequences, Proc. 5th GI-Conf. on Theoret Comput. Sci., Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167-183.
47. C. Priami, Stochastic π-calculus, in: [18], pp. 578-589.
48. C. Priami, Stochastic π-calculus with general distributions, in: [53], pp. 41-57.
49. S. Purushothaman, P.A. Subrahmanyam, Reasoning about probabilistic behavior in concurrent systems, IEEE Trans. Software Engng. 13 (1987) 740-745.
50. J. Quemada, D. de Frutos, A. Azcorra, TIC: A timed calculus for LOTOS, Formal Aspects Comput. 5 (1993) 212-252.
51. G.M. Reed, A.W. Roscoe, A timed model for communicating sequential processes, Theoret. Comput. Sci. 58 (1988) 249-261.
52. M. Rettelbach, Probabilistic branching in markovian process algebras, in: [18], pp. 590-599.
53. M. Ribaudo (Ed.), Proc. 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), CLUT, Torino, Italy, 1996.
54. P. Schweitzer, Aggregation methods for large markov chains, in: Mathematical Computer Performance and Reliability, North-Holland, Amsterdam, 1984, pp. 275-286.
55. R. Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, Ph.D. Thesis, MIT, 1995.
56. K. Seidel, Probabilistic communicating processes, Theoret. Comput. Sci. 152 (1995) 219-249.
57. S.A. Smolka, B. Steffen, Priority as extremal probability, in: Proc. 1st Int. Conf. Concurrency Theory (CONCUR '90), Amsterdam, The Netherlands, Lecture Notes in Computer Science, vol. 458, Springer, Berlin, 1990, pp. 456-466.
58. C. Tofts, Processes with probabilities, priority and time, Formal Aspects Comput. 6 (1994) 536-564.
59. C.A. Vissers, G. Scollo, M. van Sinderen, E. Brinksma, Specification styles in distributed systems design and verification, Theoret. Comput. Sci. 89 (1991) 179-206.
60. W. Yi, CCS + Time=An Interleaving Model for Real Time Systems, Proc. 18th Int. Coll. on Automata, Languages and Programming (ICALP '91), Madrid (Spain), Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 217-228.