Dynamic concurrent processes

  • J. Fanchon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 605)


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.


communicating processes operational semantics true concurrency graphs dynamic placement 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ac]
    L.Aceto, A static view of localities, RR INRIA, July 1991.Google Scholar
  2. [Bes]
    E. Best, Concurrent behaviours: sequences, processes and axioms, LNCS 255 (1987).Google Scholar
  3. [BC]
    G. Boudol, I. Castellani, Permutation of transitions, an event structure semantics for CCS. LNCS 354.Google Scholar
  4. [BCHK]
    G.Boudol,I.Castellani, M.Hennessy, A.Kiehn,Observing localities. MFCS 91.LNCS 520.Google Scholar
  5. [DDM]
    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. [Fan]
    J. Fanchon, Fifo-Net models for processes with asynchronous communication., Proceedings 12th ICPN, Arrhus, June 1991.Google Scholar
  7. [FM]
    J. Fanchon, D.Millot, Models for dynamically placed concurrent processes. PARLE 91, LNCS 506.Google Scholar
  8. [GIVa]
    R. van Glabeek, F. Vaandrager, Petri nets models for algebraic theories of concurrency, LNCS 259 (1987) 224–242.Google Scholar
  9. [Gra]
    J. Grabowski, On partial languages, Fundamenta Informaticae IV.2, 1981.Google Scholar
  10. [Kr]
    P.Krishnan, Distributed CCS, CONCUR 91. LNCS 527.Google Scholar
  11. [Maz]
    A. Mazurkiewicz, Trace theory, LNCS 255 (1986).Google Scholar
  12. [Mil]
    R. Milner, Lectures on a Calculus for Communicating Systems, Proc. Seminar on Concurrency, LNCS 197, 1985, pp. 197–220Google Scholar
  13. [MV]
    D. Millot, J. Vautherin, True Parallelism on an Unknown Topology, RR. 502, LRI Univ. Paris-Sud, July 89Google Scholar
  14. [Pom]
    L.Pomello, Some equivalence notions for concurrent systems, LNCS 222 (1986).Google Scholar
  15. [Pra]
    V. Pratt, Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, vol 15 (1), 1986, pp. 36–91CrossRefGoogle Scholar
  16. [PS]
    C.C. Prince, M.A. Salama, Scheduling of precedence-constrained task on multiprocessors The Computer Journal Vol 33 (3) 1990, pp 219–229.CrossRefGoogle Scholar
  17. [Win]
    G.Winskel, Categories of models for concurrency, Advanced School on Concurrency, Gargnano del Garda, October 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • J. Fanchon
    • 1
  1. 1.Laboratoire de Recherche en InformatiqueCNRS UA 410, Bat 490, Université Paris-SudOrsay CedexFrance

Personalised recommendations