RT Journal Article
T1 Probabilistic Ianov's schemes
A1 Frutos Escrig, David De
AB We present probabilistic Ianov's schemes, studying their semantics and proving the equivalence between operational and denotational ones. We also study the equivalence of schemes relative to them; as usual all these equivalence problems are decidable, and we prove it giving the appropriate decision algorithms.
PB Elsevier Science
SN 0304-3975
YR 1987
FD 1987
LK https://hdl.handle.net/20.500.14352/64800
UL https://hdl.handle.net/20.500.14352/64800
LA eng
NO Frutos Escrig, D. «Probabilistic Ianov’s Schemes». Theoretical Computer Science, vol. 53, n.o 1, 1987, pp. 67-97. DOI.org (Crossref), https://doi.org/10.1016/0304-3975(87)90027-2.
NO This paper is an extended version of the one with the same title that was presented at CAAP-86, and that appeared in Lecture Notes of Computer Science 214, (Springer, Berlin, 1986).
DS Docta Complutense
RD 5 abr 2025