Contextual occurrence nets and concurrent constraint programming

  • Ugo Montanari
  • Francesca Rossi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 776)


This paper proposes a new semantics for concurrent constraint programs. The meaning of each program is defined as a contextual net, which is just a usual net where context conditions, besides pre- and post-conditions, are allowed. Context conditions are just items which have to be present in order for an event to take place, but which are not affected by the event. They are very useful for describing situations where different events share a common resource and want to read it simultaneously. In fact, such events are concurrent in the net. The causal dependency relation of the net induces a partial order among objects in the same computation, while its mutual exclusion relation provides a way of expressing nondeterministic information. Such information can be of great help to a scheduler while trying to find an efficient execution of the program, or also to a compile-time optimizer.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Corradini A., Ehrig H., Lowe M., Montanari U., Rossi F., “Standard Representation of Graphs and Graph Derivations”, TU Berlin Technical Report, 1992.Google Scholar
  2. 2.
    Corradini A., Ehrig H., Lowe M., Montanari U., Rossi F., “Abstract Graph Derivations in the Double Pushout Approach”, draft.Google Scholar
  3. 3.
    Ehrig H., “Introduction to the Algebraic Theory of Graph Grammars”, in: Proc. Internat. Workshop on Graph Grammars, Springer, LNCS 73, 1978, pp. 1–81.Google Scholar
  4. 4.
    Lloyd J. W., “Foundations of Logic Programming”, Springer Verlag, 1987.Google Scholar
  5. 5.
    Montanari U., Rossi F., “True Concurrency in Concurrent Constraint Programming”, on Proc. ILPS91, MIT Press, 1991.Google Scholar
  6. 6.
    Montanari U., Rossi F., “Graph rewriting for a partial ordering semantics of concurrent constraint programming”, in Theoretical Computer Science, special issue on graph grammars, Courcelle B. editor, vol.109, 1993.Google Scholar
  7. 7.
    Montanari, U., Rossi, F., “Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics”, in: J.-C. Raoult, Ed., Proc CAAP'92, Springer LNCS 581, pp. 232–247.Google Scholar
  8. 8.
    Montanari U., Rossi F., “Contextual nets”, to appear in Acta Informatica. Also Technical Report TR-4/93, University of Pisa, CS Department, 1992.Google Scholar
  9. 9.
    Reisig W., “Petri Nets: An Introduction”, Springer Verlag, EATCS Monographs on Theoretical Computer Science, 1985.Google Scholar
  10. 10.
    Scott D.S., “Domains for denotational semantics”, on Proc. ICALP, 1982.Google Scholar
  11. 11.
    Saraswat V. A., “Concurrent Constraint Programming Languages”, Ph.D. Thesis, Carnegie-Mellon University, 1989. Also 1989 ACM Dissertation Award, MIT Press, 1993.Google Scholar
  12. 12.
    Saraswat V. A., Rinard M., “Concurrent Constraint Programming”, in Proc. POPL, ACM, 1990.Google Scholar
  13. 13.
    Saraswat V. A., Rinard M., Panangaden P., “Semantic Foundations of Concurrent Constraint Programming”, in Proc. POPL, ACM, 1991.Google Scholar
  14. 14.
    Winskel G., “Event Structures”, in Petri nets: applications and relationships to other models of concurrency, Springer-Verlag, LNCS 255.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Ugo Montanari
    • 1
  • Francesca Rossi
    • 1
  1. 1.Computer Science DepartmentUniversity of PisaPisaItaly

Personalised recommendations