Advertisement

True concurrency: Theory and practice

  • Ugo Montanari
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 669)

Keywords

Logic Program Logic Programming Graph Grammar Algebraic Semantic Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Corradini, A. and Montanari, U., An Algebraic Semantics of Logic Programs as Structured Transition Systems, invited talk, Proc. North American Conference on Logic Programming (NACLP) 1990, Austin, Texas, MIT Press, pp. 788–812.Google Scholar
  2. 2.
    Corradini, A. and Montanari, U., An Algebra of Graphs and Graph Rewriting, invited paper, Proc. 4th Conference on Category Theory and Computer Science, Spriger LNCS 530, pp. 236–260, 1991.Google Scholar
  3. 3.
    Corradini, A. and Montanari, U., An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs, to appear in TCS.Google Scholar
  4. 4.
    Corradini, A., Montanari, U. and Rossi, F., CHARM: Concurrency and Hiding in an Abstract Rewriting Machine, Proc.FGCS'92, Vol. 2, Ohmsha 1992, pp887–896.Google Scholar
  5. 5.
    De Francesco, N., Montanari, U. and Ristori G., Modeling Serializability via Process Equivalence in Petri Nets, draft, March 1992.Google Scholar
  6. 6.
    Degano, P., Meseguer, J. and Montanari, U., Axiomatizing Net Computations and Processes, Proc. 4th Symp. on Logics in Computer Science, IEEE 1989, pp. 175–185.Google Scholar
  7. 7.
    Degano, P., Meseguer, J. and Montanari, U., Axiomatizing the Algebra of Net Computations and Processes, Technical Report TR-1/91, Dipartimento di Informatica, University of Pisa, January 1991.Google Scholar
  8. 8.
    Ehrig, H., Introduction to the Algebraic Theory of Graph Grammars, Proc. International Workshop on Graph Grammars, Springer LNCS 73, 1978.Google Scholar
  9. 9.
    Gorrieri, R. and Montanari, U., Distributed Implementation of CCS, Proc. 12th International Conference on Applications and Theory of Petri Nets, 1991, pp. 329–348.Google Scholar
  10. 10.
    Gorrieri, R. and Montanari, U., On the Implementation of Concurrent Calculi into Net Calculi: Two Case Studies, draft, December 1991.Google Scholar
  11. 11.
    Laneve, C. and Montanari, U., Mobility in the cc-Paradigm, to appear in Proc. MFCS'92.Google Scholar
  12. 12.
    Laneve, C. and Montanari, U., An Axiomatization of the Concurrent Semantics of the Lambda Calculus, to appear in Proc. ALP'92, Pisa, September 1992.Google Scholar
  13. 13.
    Meseguer, J., Conditional rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science 96 (1992), pp. 73–155.CrossRefGoogle Scholar
  14. 14.
    Meseguer, J. and Montanari, U., Petri Nets are Monoids, Info and Co, Vol. 88, No. 2 (October 1990), 105–155. Also SRI-CSL-88-3, January 1988.Google Scholar
  15. 15.
    Montanari, U. and Rossi, F., True-Concurrency in Concurrent Constraint Programming, in V. Saraswat and K. Ueda, Eds., Proc. International Logic Programming Symposium '91, MIT Press, pp.694–713.Google Scholar
  16. 16.
    Montanari, U., and Rossi, F., Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming, to appear in TCS.Google Scholar
  17. 17.
    Montanari, U. and Rossi, F., Contextual Nets, draft, Jan. 1992.Google Scholar
  18. 18.
    Montanari, U. and Rossi, F., Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics, in: J.-C. Raoult, Ed., CAAP'92, Springer LNCS 581, pp. 232–247.Google Scholar
  19. 19.
    Montanari, U. and Rossi, F., An Event Structure Semantics for Concurrent Constraint Programming, Proc. Workshop on Constraint Logic Programming, Tokyo, June 1992.Google Scholar
  20. 20.
    Montanari, U. and Yankelevich, D., Partial Order Localities, to appear in Proc. ICALP'92.Google Scholar
  21. 21.
    Mowbray, M., A Proposal to Look For a New Scheduling Strategy for VLIW Compilers, Hewlett Packard Pisa Science Centre, April 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ugo Montanari
    • 1
  1. 1.Dipartimento di InformaticaUniversity of PisaItaly

Personalised recommendations