A process algebra for probabilistic and nondeterministic processes

Information Processing Letters

Volumn 80, Issue 1, 2001, Pages 15-23

  Cazorla, D ^a   Cuartero, F ^a   Valero, V ^a   Pelayo, F L ^a  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

Concurrency; Formal semantics; Specification languages

Indexed keywords

ALGEBRA; DECISION THEORY; PROBABILISTIC LOGICS; PROBABILITY DISTRIBUTIONS; SEMANTICS; THEOREM PROVING;

NONDTERMINISTIC PROCESSES; PROBABILISTIC PROCESSES; PROCESS ALGEBRA;

DATA REDUCTION;

EID: 0035888409     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00213-7     Document Type: Article

References (17)

1. Process algebra with probabilistic choice
2. TPAL: A timed-probabilistic model for concurrent processes
3. A sound and complete proof system for probabilistic processes
4. Algebraic reasoning for probabilistic concurrent systems
5. A calculus for communicating systems with time and probabilities
6. Compositional testing preorders for probabilistic processes
7. Equivalences, congruences and complete axiomatizations for probabilistic processes
8. Bisimulation through probabilistic testing
9. Refinement-oriented probability for CSP
10. Acceptance trees for probabilistic processes
11. Probabilistic simulations for probabilistic processes
12. Reactive, generative ans stratified models of probabilistic processes
13. Automatic verification of probabilistic concurrent finite-state programs
14. Testing probabilistic and nondeterministic processes