Skip to main content
SpringerLink
Log in

Nets of processes and data flow

  • Technical Contributions
  • Conference paper
  • First Online:
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (REX 1988)

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

Abstract

Nets of Processes provide a unifying approach to semantics of concurrently executing agents. In this framework modularity and Kahn's principle are investigated for Data Flow Networks.

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.

7. References

  1. Brock, J.D and Ackerman, W.B, Scenarios: A Model of Non-Deterministic Computations, In Formalization of Programming Concepts, LNCS 107, 1981, 252–259.

    Google Scholar 

  2. Faustini, A.A., An Operational Semantics for Pure Dataflow., LNCS 140, 1982, 212–224.

    Google Scholar 

  3. Gaifman, H., Pratt, V.R., Partial Order Models of Concurrency and the Computation of Functions, LICS 1987.

    Google Scholar 

  4. Kahn, G., The Semantics for a Simple Language for Parallel Programming, IFIP 74.

    Google Scholar 

  5. Kahn, G., Plotkin, G., Structure de donnes concretes. IRIA-LABORIA Report 336 1978

    Google Scholar 

  6. Lynch, N., Stark, E., A Proof of the Kahn Principle for Input/Output Automata Report Mit/LCS/TM-349 1988

    Google Scholar 

  7. Milner, R., Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25, 1983.

    Google Scholar 

  8. Pratt, V., Modeling Concurrency with Partial Order, International Journal of Parallel Programming, Vol. 15, 1986

    Google Scholar 

  9. Rabinovich, A., Pomset Semantics is Consistent with Data Flow Semantics, Bulletin of EATCS vol. 32, 1987.

    Google Scholar 

  10. Rabinovich, A., Trakhtenbrot, B. A., Behaviour Structures and Nets, to appear in Fundamenta Informatica 1988

    Google Scholar 

  11. Trakhtenbrot, B. A., Recursive Program Schemes and Computable Functionals, LNCS, vol. 45, 1976.

    Google Scholar 

  12. Trakhtenbrot, B. A., Rabinovich, A., Hirshfeld, J., Nets of Processes, Technical Report 97/88 Institute of Computer Science, Tel Aviv University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, 69978, Tel-Aviv, Israel

    A. Rabinovich & B. A. Trakhtenbrot

Authors
  1. A. Rabinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. A. Trakhtenbrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rabinovich, A., Trakhtenbrot, B.A. (1989). Nets of processes and data flow. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. REX 1988. Lecture Notes in Computer Science, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013036

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation