Skip to main content
SpringerLink
Log in

Probabilistic Ianov's schemes

  • Program Schemes And Programming
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 214))

Included in the following conference series:

  • 131 Accesses

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.

(Extended abstract)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. ENGELFRIET "Simple program schemes and formal languages" LNCS 20 Springer Verlag (1974).

    Google Scholar 

  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. D. FRUTOS ESCRIG "Some probabilistic powerdomains in SFP" STACS-86 (to appear in LNCS).

    Google Scholar 

  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. S. HART, M. SHARIR, A. PNUELI "Termination of probabilistic concurrent programs" ACM TOPLAS 5,3 (1983) 356–380.

    Google Scholar 

  6. Y. IANOV "The logical schemes of algorithms" Problemy Kibernet. 1 (1960) 82–140.

    Google Scholar 

  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. A.PAZ "Introduction to probabilistic automata" Academic Press (1971)

    Google Scholar 

  9. G. PLOTKIN "A powerdomain construction" SIAM J.Comput. 5(3) (1976) 452–487.

    Google Scholar 

  10. M.B.SMYTH "Powerdomains" LNCS 45 Springer Verlag (1978) 537–543.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Ecuaciones Funcionales — Fac. C. Matemáticas, Universidad Complutense, 28040, Madrid, Spain

    D. Frutos Escrig

Authors
  1. D. Frutos Escrig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Escrig, D.F. (1986). Probabilistic Ianov's schemes. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022665

Download citation

  • DOI: https://doi.org/10.1007/BFb0022665

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation