This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Corradini, A. and Montanari, U., An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs, to appear in TCS.
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.
De Francesco, N., Montanari, U. and Ristori G., Modeling Serializability via Process Equivalence in Petri Nets, draft, March 1992.
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.
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.
Ehrig, H., Introduction to the Algebraic Theory of Graph Grammars, Proc. International Workshop on Graph Grammars, Springer LNCS 73, 1978.
Gorrieri, R. and Montanari, U., Distributed Implementation of CCS, Proc. 12th International Conference on Applications and Theory of Petri Nets, 1991, pp. 329–348.
Gorrieri, R. and Montanari, U., On the Implementation of Concurrent Calculi into Net Calculi: Two Case Studies, draft, December 1991.
Laneve, C. and Montanari, U., Mobility in the cc-Paradigm, to appear in Proc. MFCS'92.
Laneve, C. and Montanari, U., An Axiomatization of the Concurrent Semantics of the Lambda Calculus, to appear in Proc. ALP'92, Pisa, September 1992.
Meseguer, J., Conditional rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science 96 (1992), pp. 73–155.
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.
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.
Montanari, U., and Rossi, F., Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming, to appear in TCS.
Montanari, U. and Rossi, F., Contextual Nets, draft, Jan. 1992.
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.
Montanari, U. and Rossi, F., An Event Structure Semantics for Concurrent Constraint Programming, Proc. Workshop on Constraint Logic Programming, Tokyo, June 1992.
Montanari, U. and Yankelevich, D., Partial Order Localities, to appear in Proc. ICALP'92.
Mowbray, M., A Proposal to Look For a New Scheduling Strategy for VLIW Compilers, Hewlett Packard Pisa Science Centre, April 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montanari, U. (1993). True concurrency: Theory and practice. In: Bird, R.S., Morgan, C.C., Woodcock, J.C.P. (eds) Mathematics of Program Construction. MPC 1992. Lecture Notes in Computer Science, vol 669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56625-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-56625-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56625-0
Online ISBN: 978-3-540-47613-9
eBook Packages: Springer Book Archive