Algebraic theory of probabilistic and nondeterministic processes

Journal of Logic and Algebraic Programming

Volumn 55, Issue 1-2, 2003, Pages 57-103

  Cazorla, Diego ^a   Cuartero, Fernando ^a   Valero, Valentín ^a   Pelayo, Fernando L ^a   Pardo, J José ^a  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

Denotational semantics; Probabilistic and nondeterministic processes; Process algebra; Proof system; Testing semantics

Indexed keywords

ALGEBRA; CONCURRENT ENGINEERING; MATHEMATICAL MODELS; PROBABILISTIC LOGICS;

DENOTATIONAL SEMANTICS;

SEMANTICS;

EID: 0037340811     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(02)00040-1     Document Type: Article

References (37)

1. S. Andova, Process algebra with probabilistic choice, in: Proceedings of ARTS'99, LNCS 1601, 1999.
2. B. Bloom, A.R. Meyer, A remark on bisimulation between probabilistic processes, in: A.R. Meyer, M.A. Taitslin (Eds.), Logik at Botik, Springer-Verlag, Berlin, 1989.
3. Cazorla D., Cuartero F., Valero V., Pelayo F.L. A process algebra for probabilistic and nondeterministic processes. Information Processing Letters. 80(1):2001;15-23.
4. I. Christoff, Testing equivalence for probabilistic processes, PhD thesis, Uppsala University, Sweden, 1990.
5. Cleaveland R., Dayar Z., Smolka S.A., Yuen S. Testing preorders for probabilistic processes. Information and Computation. 154(2):1999;219-241.
6. R. Cleaveland, S. Purushothaman Iyer, Branching time probabilistic model checking, in: Carleton Scientific (Ed.), ICALP Workshops 2000, Proceedings in Informatics, vol. 8, 2000, pp. 487-500.
7. F. Cuartero, D. de Frutos, V. Valero, PCSP: a denotational model for probabilistic processes, in: Proceedings of Third AMAST Workshop on Real-Time Systems, 1996.
8. F. Cuartero, D. de Frutos, V. Valero, A sound and complete proof system for probabilistic processes, in: ARTS'97, LNCS 1231, 1997.
9. D'Argenio P.R., Hermanns H., Katoen J.-P. On generative parallel composition. Electronic Notes in Theoretical Computer Science. 22:1999;25.
10. L. de Alfaro, Formal verification of probabilistic systems, PhD thesis, Stanford University, 1998.
11. de Nicola R., Hennessy M. Testing equivalences for processes. Theoretical Computer Science. 34:1984;83-133.
12. J.I. den Hartog, E.P. de Vink, Mixing up nondeterminism and probability: a preliminary report, in: Proceedings of the PROBMIV'98, Electronic Notes in TCS, 1998.
13. A. Giacalone, C.-C. Jou, S.A. Smolka, Algebraic reasoning for probabilistic concurrent systems, in: Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2, Sea of Galilee, Israel, 1990.
14. C. Gregorio, L. Llana, M. Núñez, P. Palao, Testing semantics for a probabilistic-timed process algebra, in: Proceedings of Fourth AMAST Workshop on Real-Time Systems, LNCS 1231, 1997.
15. C. Gregorio, M. Núñez, Denotational semantics for probabilistic refusal testing, in: Proceedings of the PROBMIV'98, Electronic Notes in TCS, vol. 22, 1998.
16. Groote J.F. Transition system specifications with negative premises. Theoretical Computer Science. 118:1993;263-299.
17. H. Hansson, B. Jonsson, A calculus for communicating systems with time and probabilities, in: Proceedings Real-Time Systems Symposium, Orlando, FL, 1990.
18. Hennessy M. Algebraic Theory of Processes. 1988;MIT Press, Cambridge, MA.
19. C. Jones, Probabilistic non-determinism, PhD thesis, University of Edinburgh, 1990.
20. C. Jones, G.D. Plotkin, A probabilistic powerdomain of evaluations, in: Proceedings of Fourth Annual Symposium on Logic in Computer Science, 1989.
21. Jonsson B., Yi W. Compositional testing preorders for probabilistic processes. in: 10th IEEE Symposium on Logic in Computer Science San Diego, CA. 1995;431-443.
22. B. Jonsson, W. Yi, Fully abstract characterization of probabilistic may testing, in: Fifth International AMAST Workshop on Real-Time and Probabilistic Systems, ARTS'99, LNCS 1601, 1999.
23. C. Jou, S.A. Smolka, Equivalences, congruences and complete axiomatizations for probabilistic processes, in: Proceedings of CONCUR'90, LNCS 458, 1990.
24. M.Z. Kwiatkowska, G. Norman, A fully abstract metric-space denotational semantics for reactive probabilistic processes, in: Proceedings of the COMPROX'98, Electronic Notes in TCS, vol. 13, 1998.
25. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Information and Computation. 94(1):1991;1-28.
26. G. Lowe, Representing nondeterministic and probabilistic behaviour in reactive processes, Technical Report PRG-TR-11-93, Oxford University Computing Laboratory, 1993.
27. Morgan C., McIver A., Seidel K., Sanders J.W. Refinement-oriented probability for CSP. Formal Aspects of Computing. 8(6):1996;617-647.
28. Núñez M., de Frutos D. Testing semantics for probabilistic LOTOS. Formal Description Techniques VIII. 1995;365-380.
29. Núñez M., de Frutos D., Llana L. Acceptance trees for probabilistic processes. CONCUR'95, LNCS 962. 1995;249-263.
30. R. Segala, A compositional trace-based semantics for probabilistic automata, in: Proceedings of CONCUR'95, LNCS 962, 1995.
31. R. Segala, N. Lynch, Probabilistic simulations for probabilistic processes, in: Proceedings of CONCUR'94, LNCS 836, 1994.
32. van Glabbeek R., Smolka S.A., Steffen B.U. Reactive, generative ans stratified models of probabilistic processes. Information and Computation. 121(1):1995;59-80.
33. van Glabbeek R., Smolka S.A., Steffen B.U., Tofts C.M.N. Reactive, generative ans stratified models of probabilistic processes. in: Proceedings of Fifth Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA. 1990;130-141.
34. Vardi M.Y. Automatic verification of probabilistic concurrent finite-state programs. in: Proceedings of 26th FOCS. 1985;327-338.
35. Yi W. Algebraic reasoning for real-time probabilistic processes with uncertainty information. Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, Kiel, Germany. 1994;680-693.
36. Yi W., Larsen K.G. Testing probabilistic and nondeterministic processes. Protocol Specification, Testing and Verification XII. 1992;47-61.
37. Yuen S., Cleveland R., Dayar Z., Smolka S.A. Fully abstract characterization of testing preorders for probabilistic processes. CONCUR'94, LNCS 836. 1994;497-512.