Skip to main content
Springer Nature Link
Log in

A Compositional Model for Confluent Dynamic Data-Flow Networks

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2000 (MFCS 2000)

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

  • 527 Accesses

Abstract

We introduce a state-based language for programming dynamically changing networks which consist of processes that communicate asynchronously. For this language we introduce an operational semantics and a notion of observable which includes both partial correctness and absence of deadlock. Our main result is a compositional characterization of this notion of observable for a confluent sub-language.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. G. Agha, I. Mason, S. Smith, and C. Talcott. A foundation for actor computation Journal of Functional Programming, 1(1):1–69, 1993.

    MathSciNet  Google Scholar 

  2. R. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for the Asynchronous π-calculus. Theoretical Computer Science, 195:291–324, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. Arbab, F.S. de Boer, and M.M. Bonsangue. A coordination language for mobile components. In Proc. of SAC 2000, pp. 166–173, ACM press, 2000.

    Google Scholar 

  4. F. Arbab, I. Herman, and P. Spilling. An overview of Manifold and its implementation. Concurrency: Practice and Experience, 5(1):23–70, 1993.

    Article  Google Scholar 

  5. F.S. de Boer. Reasoning about asynchronous communication in dynamically evolving object structures. To appear in Theoretical Computer Science, 2000.

    Google Scholar 

  6. M. Broy. Equations for describing dynamic nets of communicating systems. In Proc. 5th COMPASS workshop, vol. 906 of LNCS, pp. 170–187, 1995.

    Google Scholar 

  7. L. Cardelli and A.D. Gordon. Mobile ambients. In Proc. of Foundation of Software Science and Computational Structures, vol. 1378 of LNCS, pp. 140–155, 1998.

    Chapter  Google Scholar 

  8. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.

    Google Scholar 

  9. M. Falaschi, M. Gabbrielli, K. Marriot, and C. Palamidessi. Confluence in concurrent constraint programming. In Theoretical Computer Science, 183(2), 1997.

    Google Scholar 

  10. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join calculus. In Proc. POPL’96, pp. 372–385, 1996.

    Google Scholar 

  11. R. Grosu and K. Stølen. A model for mobile point-to-point data-flow networks without channel sharing. In Proc. AMAST’96, LNCS, 1996.

    Google Scholar 

  12. G.J. Holzmann. The model checker SPIN IEEE Transactions on Software Engineering 23:5, 1997.

    Google Scholar 

  13. G. Kahn. The semantics of a simple language for parallel programming. In IFIP74 Congress, North Holland, Amsterdam, 1974.

    Google Scholar 

  14. He Jifeng, M.B. Josephs, and C.A.R. Hoare. A theory of synchrony and asynchrony. In Proc. IFIP Conf. on Programming Concepts and Methods, 1990.

    Google Scholar 

  15. B. Jonsson. A fully abstract trace model for dataflow and asynchronous networks. Distributed Computing, 7:197–212, 1994.

    Article  MATH  Google Scholar 

  16. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation 100(1):1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. E.-R. Olderog and C.A.R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica 23:9–66, 1986.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Utrecht University, The Netherlands

    Frank S. de Boer

  2. CWI, Amsterdam, The Netherlands

    Marcello M. Bonsangue

Authors
  1. Frank S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcello M. Bonsangue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Department of Computer Sciene, Comenius University, 84248, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Boer, F.S., Bonsangue, M.M. (2000). A Compositional Model for Confluent Dynamic Data-Flow Networks. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics