Probabilistic Ianov's schemes
Loading...
Download
Official URL
Full text at PDC
Publication date
1987
Authors
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science
Citations
Exportar
Citation
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.
Abstract
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.
Description
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).