Algebraic theory of probabilistic processes

Journal of Logic and Algebraic Programming

Volumn 56, Issue 1-2 SPEC., 2003, Pages 117-177

  Núñez, Manuel ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Probabilistic process algebras; Probabilistic testing semantics

Indexed keywords

ALGEBRA; MATHEMATICAL MODELS; PROBABILITY; SEMANTICS;

PROCESS ALGEBRAS; TESTING SEMANTICS;

PROBABILISTIC LOGICS;

EID: 17144443361     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(02)00069-3     Document Type: Article

References (37)

1. S. Andova, Process algebra with probabilistic choice, In: 5th AMAST Workshop on Real-Time and Probabilistic Systems, LNCS 1601, Springer, 1999, pp. 111-130.
2. S. Andova, J.C.M. Baeten, Abstraction in probabilistic process algebra, In: TACAS 2001, LNCS 2031, Springer, 2001, pp. 204-219.
3. Baeten J.C.M., Bergstra J.A., Smolka S.A. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation. 121(2):1995;234-255.
4. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;North Holland.
5. M. Bravetti, A. Aldini, Expressing processes with different action durations through probabilities, In: PAPM-PROBMIV 2001, LNCS 2165, Springer, 2001, pp. 168-183.
6. D. Cazorla, PNAL: Un modelo algebraico para procesos probabilísticos y no deterministas, Ph.D. thesis, Universidad de Castilla-La Mancha, 2001.
7. Cazorla D., Cuartero F., Valero V., Pelayo F.L. A process algebra for probabilistic and nondeterministic processes. Information Processing Letters. 80:2001;15-23.
8. I. Christoff, Testing equivalences and fully abstract models for probabilistic processes, In: CONCUR'90, LNCS 458, Springer, 1990, pp. 126-140.
9. Cleaveland R., Dayar Z., Smolka S.A., Yuen S. Testing preorders for probabilistic processes. Information and Computation. 154(2):1999;93-148.
10. Cleaveland R., Lüttgen G., Natarajan V. Priority in process algebra. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;North Holland. Chapter 11.
11. F. Cuartero, CSP probabilístico (PCSP). Un modelo probabilístico de procesos concurrentes, Ph.D. thesis, Universidad Complutense de Madrid, 1993.
12. F. Cuartero, D. de Frutos, V. Valero, A sound and complete proof system for probabilistic processes, In: 4th International AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software, LNCS 1231, Springer, 1997, pp. 340-352.
13. P.R. D'Argenio, H. Hermanns, J.-P. Katoen, On generative parallel composition, In: PROBMIV'98, Electronics Notes in Theoretical Computer Science 22, Elsevier, 1999.
14. R. de Nicola, M. Hennessy, CCS without τ 's, In: TAPSOFT'87, LNCS 249, Springer, 1987, pp. 138-152.
15. van Glabbeek R., Smolka S.A., Steffen B. Reactive, generative and stratified models of probabilistic processes. Information and Computation. 121(1):1995;59-80.
16. C. Gregorio, M. Núñez, Denotational semantics for probabilistic refusal testing, In: PROBMIV'98, Electronics Notes in Theoretical Computer Science 22, Elsevier, 1999.
17. Hansson H., Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing. 6:1994;512-535.
18. Hennessy M. Acceptance trees. Journal of the ACM. 32(4):1985;896-928.
19. Hennessy M. Algebraic Theory of Processes. 1988;MIT Press.
20. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice Hall.
21. B. Jonsson, W. Yi, Compositional testing preorders for probabilistic processes, In: 10th IEEE Symposium on Logic In Computer Science, IEEE-CS Press, 1995, pp. 431-443.
22. Jonsson B., Yi W., Larsen K.G. Probabilistic extensions of process algebras. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;North Holland. Chapter 12.
23. C.-C. Jou, S.A. Smolka, Equivalences, congruences and complete axiomatizations for probabilistic processes, In: CONCUR'90, LNCS 458, Springer, 1990, pp. 367-383.
24. M. Kwiatkowska, G.J. Norman, A testing equivalence for reactive probabilistic processes, In: EXPRESS'98, Electronic Notes in Theoretical Computer Science, vol. 16, Elsevier, 1998.
25. Larsen K., Skou A. Bisimulation through probabilistic testing. Information and Computation. 94(1):1991;1-28.
26. N. López, M. Núñez, A testing theory for generally distributed stochastic processes, In: CONCUR 2001, LNCS 2154, Springer, 2001, pp. 321-335.
27. Lowe G. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science. 138:1995;315-352.
28. K. Narayan Kumar, R. Cleaveland, S.A. Smolka, Infinite probabilistic and nonprobabilistic testing, In: 18th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, Springer, 1998, pp. 209-220.
29. de Nicola R., Hennessy M.C.B. Testing equivalences for processes. Theoretical Computer Science. 34:1984;83-133.
30. M. Núñez, An axiomatization of probabilistic testing, In: 5th AMAST Workshop on Real-Time and Probabilistic Systems, LNCS 1601, Springer, 1999, pp. 130-150.
31. M. Núñez, D. de Frutos, Testing semantics for probabilistic LOTOS, In: Formal Description Techniques VIII, Chapman and Hall, 1995, pp. 365-380.
32. M. Núñez, D. de Frutos, L. Llana, Acceptance trees for probabilistic processes, In: CONCUR'95, LNCS 962, Springer, 1995, pp. 249-263.
33. Núñez M., Rupérez D. Fair testing through probabilistic testing. Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX). 1999;135-150 Kluwer Academic Publishers.
34. R. Segala, Testing probabilistic automata, In: CONCUR'96, LNCS 1119, Springer, 1996, pp. 299-314.
35. Stark E.W., Smolka S.A. A complete axiom system for finite-state probabilistic processes. Proof, Language and Interaction: Essays in Honour of Robin Milner. 2000;MIT Press.
36. Wu S.-H., Smolka S.A., Stark E.W. Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science. 176(1-2):1997;1-37.
37. W. Yi, K.G. Larsen, Testing probabilistic and nondeterministic processes, In: Protocol Specification, Testing and Verification XII, North Holland, 1992, pp. 47-61.