Probabilistic Ianov's schemes
DF Escrig - Theoretical Computer Science, 1987 - Elsevier
Theoretical Computer Science, 1987•Elsevier
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.
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.
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.
Elsevier
Showing the best result for this search. See all results