Discrete time generative-reactive probabilistic processes with different advancing speeds

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 355-406

  Bravetti, M ^a   Aldini, A ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Discrete time Markov chain; Performance evaluation; Probabilistic models; Process Algebra

Indexed keywords

ALGEBRA; DISCRETE TIME CONTROL SYSTEMS; MARKOV PROCESSES; PARALLEL PROCESSING SYSTEMS; PROBABILITY; SYNCHRONIZATION;

DISCRETE TIME MARKOV CHAIN (DTMC); PROCESS ALGEBRA;

PROBABILISTIC LOGICS;

EID: 0037209771     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00344-9     Document Type: Article

References (32)

1. Aceto L. On axiomatising finite concurrent processes. SIAM J. Comput. 23(4):1994;852-863.
2. L. Aceto, D. Murphy, On the ill-timed but well-caused, in: Proc. 4th Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993, pp. 97-111.
3. A. Aldini, M. Bernardo, R. Gorrieri, An algebraic model for evaluating the performance of an ATM switch with explicit rate marking, in: Proc. 7th Int. Workshop on Process Algebras and Performance Modeling, Prensas Universitarias de Zaragoza, 1999, pp. 119-138.
4. Aldini A., Bernardo M., Gorrieri R., Roccetti M. Comparing the QoS of internet audio mechanisms via formal methods. ACM Trans. Modeling Computer Simulation. 11:2001;1-42.
5. Baeten J.C.M., Bergstra J.A., Smolka S.A. Axiomatizing probabilistic processes: ACP with generative probabilities. Informat. and Comput. 121:1995;234-255.
6. Baeten J.C.M., Weijland W.P. Process Algebra. 1990;Cambridge University Press, Cambridge.
7. C. Baier, H. Hermanns, Weak bisimulation for fully probabilistic processes, in: Proc. 9th Int. Conf. on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, 1997, pp. 119-130.
8. M Bernardo, Theory and Application of Extended Markovian Process Algebra, Ph.D. Thesis, University of Bologna, Italy, 1999.
9. M. Bernardo, M. Bravetti, Functional and performance modeling and analysis of token ring using EMPA, in: Proc. 6th Italian Conf. on Theoretical Computer Science, World Scientific, Singapore, 1998, pp. 204-215.
10. Bernardo M., Gorrieri R., Roccetti M. Formal performance modelling and evaluation of an adaptive mechanism for packetised audio over the internet. Formal Aspects Computing. 10:1999;313-337.
11. M. Bravetti, M. Bernardo, R. Gorrieri, A note on the congruence proof for recursion in Markovian bisimulation equivalence,in: C. Priami (Ed.), Proc. 6th Int. Workshop on Process Algebras and Performance Modeling, 1998, pp. 153-164.
12. L. Cardelli, Real time agents, in: Proc. 9th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 140, Springer, Berlin, 1982, pp. 94-106.
13. Corradini F., Pistore M. Closed interval process algebra versus interval process algebra. Acta Inform. 37:2001;467-509.
14. P.R. D'Argenio, H. Hermanns, J.P. Katoen, On generative parallel composition, in: Proc. 1st Int. Workshop on Probabilistic Methods in Verifications, Electronic Notes Theoret. Comput. Sci. 22 (2000).
15. van Glabbeek R.J., Smolka S.A., Steffen B. Reactive, generative and stratified models of probabilistic processes. Inform. and Comput. 121:1995;59-80.
16. Groote J. Transition system specifications with negative premises. Theoret. Comput. Sci. 118(2):1993;263-299.
17. Hennessy M., Regan T. A process algebra for timed systems. Inform. and Comput. 117(2):1995;221-239.
18. Hillston J. A Compositional Approach to Performance Modelling. 1996;Cambridge University Press, Cambridge.
19. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice-Hall, Englewood Cliffs, NJ.
20. Howard R.A. Dynamic Probabilistic Systems. 1971;Wiley, New York.
21. C.C. Jou, S.A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, in Proc. 1st Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 458, Springer, Berlin, 1990, pp. 367-383.
22. Kleinrock L. Queueing Systems. 1975;Wiley, New York.
23. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 94:1991;1-28.
24. K.G. Larsen, A. Skou, Compositional verification of probabilistic processes, in: Proc. 3rd Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 630, Springer, Berlin, 1992, pp. 456-471.
25. N.A. Lynch, M.R. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. 6th ACM Symp. on Principles of Distributed Computing, 1987, pp. 137-151.
26. F. Moller, C. Tofts, A temporal calculus of communicating systems, in Proc. 1st Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 458, Springer, Berlin, 1990, pp. 401-415.
27. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood, Cliffs, NJ.
28. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. Thesis, MIT, Boston, MA, 1995.
29. Tanenbaum A.S. Computer Networks. 1996;Prentice-Hall, Englewood Cliffs, NJ.
30. Taylor H.M., Karlin S. An Introduction to Stochastic Modeling. 3rd ed. 1998;Academic Press, New York.
31. Tofts C. Processes with probabilities, priority and time. Formal Aspects Comput. 6:1994;536-564.
32. Wu S.H., Smolka S.A., Stark E.W. Composition and behaviors of probabilistic I/O automata. Theoret. Comput. Sci. 176:1997;1-38.