Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Logical Foundations of Computer Science

LFCS 1992: Logical Foundations of Computer Science — Tver '92 pp 394–405Cite as

Non modularity and expressibility for nets of relations (extended abstract)

  • Conference paper
  • First Online:

  • 142 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. A generalized Kahn principle for abstract asynchronous networks. In Mathematical Foundations of Programming Languages Semantics, volume 442 of LNCS, Springer Verlag, 1990.

    Google Scholar 

  2. J. D. Brock and W. B. Ackerman. Scenarios: A model of non-determinate computation. In Formalization of Programming Concepts, volume 107 of LNCS, Springer Verlag, 1981.

    Google Scholar 

  3. G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74. North Holland Publ. Co., 1974.

    Google Scholar 

  4. G. Kahn and G. Plotkin, Concrete Domains, Technical Report 1978.

    Google Scholar 

  5. A. Mazurkiewicz, A. Rabinovich, and B. A. Trakhtenbrot. Connectedness and synchronization. In Images of Programming. North Holland Publ. Co., 1991.

    Google Scholar 

  6. J. Misra. Equational reasoning about nondeterministic processes. In Proceedings of 8th A CM Symposium on Principles of Distributed Computing, 1989.

    Google Scholar 

  7. D. Park. The fairness problem and nondeterministic computing networks. In Proceedings, 4th Advanced Cource on Theoretical Computer Science. Mathematisch Centrum, 1982.

    Google Scholar 

  8. P. Panangaden, and V. Shanbhogue McCarthy's amb cannot implement fair merge. In Proceedings, 8lh FSTTSC Conference, 1988.

    Google Scholar 

  9. V. R. Pratt, e.mail correspondence, 1988.

    Google Scholar 

  10. A. Rabinovich, Modularity and Expressibility for Nets of Relations. To appear in An International Symposium on Theoretical Computer Science in honor of B. A. Trakhtenbrot

    Google Scholar 

  11. A. Rabinovich and B. A. Trakhtenbrot. Nets and data flow interpreters. In the Proceedings of the Fourth Symposium on Logic in Computer Science, 1989.

    Google Scholar 

  12. A. Rabinovich and B. A. Trakhtenbrot. Communication among relations. In ICALP90, volume 443 of LNCS. Springer Verlag, 1990.

    Google Scholar 

  13. A. Rabinovich and B. A. Trakhtenbrot. On Nets, Algebras and Modularity. In International Conference on Theoretical Aspects of Computer Software, volume 526 of LNCS. Springer Verlag, 1991.

    Google Scholar 

  14. V. Yu. Sazonov, Expressibility of Functions in Scott's LCF Language, Algebra and Logic, Vol. 15, No 3, 1976.

    Google Scholar 

  15. E. W. Stark. A simple generalization of Kahn's principle to indeterminate dataflow networks. In Semantics for concurrency, Workshops in Computing. Springer Verlag, 1990.

    Google Scholar 

  16. M. B. Trakhtenbrot, Relationship between Classes of Monotonic Functions, Theoretical Computer Science, 1976.

    Google Scholar 

  17. G. Winskel, Events in Computations, Ph. D. Thesis, CS Dept, Edinburgh Univ., 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Center, P.O. Box 218, 10598, Yorktown Heights, NY

    Alexander Rabinovich

Authors
  1. Alexander Rabinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rabinovich, A. (1992). Non modularity and expressibility for nets of relations (extended abstract). In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023892

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

  • Online ISBN: 978-3-540-47276-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation