Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Architectures and Languages Europe

PARLE 1992: PARLE '92 Parallel Architectures and Languages Europe pp 859–874Cite as

Dynamic concurrent processes

  • Conference paper
  • First Online:

  • 127 Accesses

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

Abstract

We introduce a process algebra with concurrent dynamic behaviours on graphs modelling networks of processors. It provides a framework to treat recursion and communication for dynamically placed programs. The defined semantics outline topological aspects of the terms and relate the algebraic structure of programs and the topology of networks.

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. L.Aceto, A static view of localities, RR INRIA, July 1991.

    Google Scholar 

  2. E. Best, Concurrent behaviours: sequences, processes and axioms, LNCS 255 (1987).

    Google Scholar 

  3. G. Boudol, I. Castellani, Permutation of transitions, an event structure semantics for CCS. LNCS 354.

    Google Scholar 

  4. G.Boudol,I.Castellani, M.Hennessy, A.Kiehn,Observing localities. MFCS 91.LNCS 520.

    Google Scholar 

  5. P.Degano, R.De Nicola, U.Montanari, A distributed operational semantics for CCS based on C/E systems, Acta Informatica, 26, 1988.

    Google Scholar 

  6. J. Fanchon, Fifo-Net models for processes with asynchronous communication., Proceedings 12th ICPN, Arrhus, June 1991.

    Google Scholar 

  7. J. Fanchon, D.Millot, Models for dynamically placed concurrent processes. PARLE 91, LNCS 506.

    Google Scholar 

  8. R. van Glabeek, F. Vaandrager, Petri nets models for algebraic theories of concurrency, LNCS 259 (1987) 224–242.

    Google Scholar 

  9. J. Grabowski, On partial languages, Fundamenta Informaticae IV.2, 1981.

    Google Scholar 

  10. P.Krishnan, Distributed CCS, CONCUR 91. LNCS 527.

    Google Scholar 

  11. A. Mazurkiewicz, Trace theory, LNCS 255 (1986).

    Google Scholar 

  12. R. Milner, Lectures on a Calculus for Communicating Systems, Proc. Seminar on Concurrency, LNCS 197, 1985, pp. 197–220

    Google Scholar 

  13. D. Millot, J. Vautherin, True Parallelism on an Unknown Topology, RR. 502, LRI Univ. Paris-Sud, July 89

    Google Scholar 

  14. L.Pomello, Some equivalence notions for concurrent systems, LNCS 222 (1986).

    Google Scholar 

  15. V. Pratt, Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, vol 15 (1), 1986, pp. 36–91

    Article  Google Scholar 

  16. C.C. Prince, M.A. Salama, Scheduling of precedence-constrained task on multiprocessors The Computer Journal Vol 33 (3) 1990, pp 219–229.

    Article  Google Scholar 

  17. G.Winskel, Categories of models for concurrency, Advanced School on Concurrency, Gargnano del Garda, October 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, CNRS UA 410, Bat 490, Université Paris-Sud, 91405, Orsay Cedex, France

    J. Fanchon

Authors
  1. J. Fanchon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel Etiemble Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fanchon, J. (1992). Dynamic concurrent processes. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_129

Download citation

  • DOI: https://doi.org/10.1007/3-540-55599-4_129

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55599-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation