A process algebra for probabilistic and nondeterministic processes (2001) [4 citations — 2 self]

Download:

by Diego Cazorla, O Cuartero, O L. Pelayo, Universidad De, Castilla-la Mancha, D. Cazorla, F. Cuartero, V. Valero, F. L. Pelayo

Information Processing Letters

http://www.info-ab.uclm.es/sec-ab/Tecrep/diab000111.ps

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@TECHREPORT{Cazorla01aprocess,
    author = {Diego Cazorla and O Cuartero and O L. Pelayo and Universidad De and Castilla-la Mancha and D. Cazorla and F. Cuartero and V. Valero and F. L. Pelayo},
    title = {A process algebra for probabilistic and nondeterministic processes},
    institution = {Information Processing Letters},
    year = {2001}
}

Abstract:

In this paper we present an algebraic language for the specication of probabilistic and nondeterministic processes, PNAL, which is a probabilistic extension of EPL [6] that maintains nondeterminism. Thus, we have both kinds of choices, and we have decided that probabilistic ones are rst resolved, and after that nondeterministic choices are then considered. We have dened both an operational and a testing semantics for PNAL, as well as a denotational semantics and a proof system. We show that the equivalence between nondeterministic processes in nite EPL (EPL f) is preserved, and we also prove that the testing semantics, the denotational semantics and the proof system are fully abstract. 1.

Citations

363	Algebraic Theory of Processes – Hennessy - 1988
330	Bisimulation through probabilistic testing – Larsen, Skou - 1991
185	Probabilistic simulations for probabilistic processes – Segala, Lynch
90	Algebraic reasoning for probabilistic concurrent systems – Giacalone, Jou, et al. - 1990
89	A calculus for communicating systems with time and probabilities – Hansson, Jonsson - 1990
60	Equivalences, congruences and complete axiomatizations for probabilistic processes – Jou, Smolka - 1990
46	Testing probabilistic and nondeterministic processes – Yi, Larsen - 1992
44	Compositional testing preorders for probabilistic processes – Jonsson, Yi - 1995
28	Refinement-oriented probability for CSP – Morgan, McIver, et al. - 1996
25	Process algebra with probabilistic choice – Andova - 1999
19	Acceptance trees for probabilistic processes – Nunez, Frutos, et al. - 1995
16	A testing equivalence for reactive probabilistic processes – Kwiatkowska, Norman - 1998
14	Automatic veri of probabilistic concurrent programs – Vardi - 1985
13	Representing nondeterministic and probabilistic behaviour in reactive processes – Lowe - 1993
8	A sound and complete proof system for probabilistic processes – Cuartero, Frutos, et al. - 1997
4	Reactive, generative ans strati models of probabilistic processes – Glabbeek, Smolka, et al. - 1995
3	TPAL: A timedprobabilistic model for concurrent processes – Bueno, Valero, et al. - 1997
3	Renement-oriented probability for CSP – Morgan, McIver, et al. - 1996

View or Download | Add to My Collection | Correct Errors