Frutos Escrig, David De2023-06-212023-06-211987Frutos 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.0304-397510.1016/0304-3975(87)90027-2https://hdl.handle.net/20.500.14352/64800This 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).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.engjournal articlehttps//doi.org/10.1016/0304-3975(87)90027-2http://www.sciencedirect.com/science/article/pii/0304397587900272restricted access004Informática (Informática)1203.17 Informática