Advertisement

Probabilistic Ianov's schemes

  • D. Frutos Escrig
Program Schemes And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 214)

Abstract

We present probabilistic Ianov's schemes, studying their semantics and proving the equivalences 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.

Keywords

Normal Form Operational Semantic Regular Language Probabilistic Scheme Denotational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. ENGELFRIET "Simple program schemes and formal languages" LNCS 20 Springer Verlag (1974).Google Scholar
  2. [2]
    D. FRUTOS ESCRIG "Algunas cuestiones relacionadas con la semántica de construcciones probabilísticas" Tesis doctoral Fac.C.Matemáticas U.Complutense Madrid, July 1985.Google Scholar
  3. [3]
    D. FRUTOS ESCRIG "Some probabilistic powerdomains in SFP" STACS-86 (to appear in LNCS).Google Scholar
  4. [4]
    D. FRUTOS ESCRIG, K. INDERMARK "Equivalence relations of nondeterministic Ianov's schemes" Schriften zur Informatik und Angewanten Mathematik RWTH Aachen 1986 (to appear).Google Scholar
  5. [5]
    S. HART, M. SHARIR, A. PNUELI "Termination of probabilistic concurrent programs" ACM TOPLAS 5,3 (1983) 356–380.Google Scholar
  6. [6]
    Y. IANOV "The logical schemes of algorithms" Problemy Kibernet. 1 (1960) 82–140.Google Scholar
  7. [7]
    K. INDERMARK "On a class of schematic languages" in Formal languages and Programming (Ed.R.Aguilar) North Holland (1976) 1–13.Google Scholar
  8. [8]
    A.PAZ "Introduction to probabilistic automata" Academic Press (1971)Google Scholar
  9. [9]
    G. PLOTKIN "A powerdomain construction" SIAM J.Comput. 5(3) (1976) 452–487.Google Scholar
  10. [10]
    M.B.SMYTH "Powerdomains" LNCS 45 Springer Verlag (1978) 537–543.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • D. Frutos Escrig
    • 1
  1. 1.Dpto. Ecuaciones Funcionales — Fac. C. MatemáticasUniversidad ComplutenseMadridSpain

Personalised recommendations