{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300288,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":106,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:02:54Z","timestamp":1330293774000},"page":"331-372","source":"Crossref","is-referenced-by-count":71,"title":["Rewriting logic as a semantic framework for concurrency: a progress report"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Meseguer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"unstructured":"Peter Aczel. A general Church-Rosser theorem. Manuscript, University of Manchester, 1978.","key":"21_CR1"},{"doi-asserted-by":"crossref","unstructured":"G. Agha. Actors. MIT Press, 1986.","key":"21_CR2","DOI":"10.7551\/mitpress\/1086.001.0001"},{"unstructured":"G. Agha and C. Hewitt. Concurrent programming using actors. In A. Yonezawa and M. Tokoro, editors, Object-Oriented Concurrent Programming, pages 37\u201353. MIT Press, 1988.","key":"21_CR3"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3\u201334, 1995.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Workshop on Theory of Hybrid Systems, pages 209\u2013229. Springer LNCS 739, 1993.","key":"21_CR5","DOI":"10.1007\/3-540-57318-6_30"},{"doi-asserted-by":"crossref","unstructured":"Rajeev Alur and David Dill. The theory of timed automata. In J.W. de Bakker, G. Huizing, W. P. de Roever, and G. Rozenberg, editors, Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 1991.","key":"21_CR6","DOI":"10.1007\/BFb0031987"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-6423(90)90044-E","volume":"15","author":"J.-P. Ban\u00e2tre","year":"1990","unstructured":"J.-P. Ban\u00e2tre and D. Le M\u00e8tayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15:55\u201377, 1990.","journal-title":"Science of Computer Programming"},{"doi-asserted-by":"crossref","unstructured":"E. Battiston, V. Crespi, F. De Cindio, and G. Mauri. Semantic frameworks for a class of modular algebraic nets. In M. Nivat, C. Rattray, T. Russ, and G. Scollo, editors, Proc. of the 3rd International AMAST Conference, Workshops in Computing. Springer-Verlag, 1994.","key":"21_CR8","DOI":"10.1007\/978-1-4471-3227-1_28"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon and B. Courcelle. Graph expressions and graph rewriting. Math. Systems Theory, 20:83\u2013127, 1987.","journal-title":"Math. Systems Theory"},{"issue":"1","key":"21_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G\u00e9rard Berry and G\u00e9rard Boudol. The chemical abstract machine. Theoretical Computer Science, 96(1):217\u2013248, 1992.","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E. Best","year":"1989","unstructured":"E. Best and R. Devillers. Sequential and concurrent behavior in Petri net theory. Theoretical Computer Science, 55:87\u2013136, 1989.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"M. Bettaz and M. Maouche. How to specify nondeterminism and true concurrency with algebraic term nets. In M. Bidoit and C. Choppy, editors, Recent Trends in Data Type Specification, pages 164\u2013180. Springer LNCS 655, 1993.","key":"21_CR12","DOI":"10.1007\/3-540-56379-2_39"},{"doi-asserted-by":"crossref","unstructured":"M. Bettaz and M. Maouche. Modeling of object based systems with hidden sorted ECATNets. In Proc. of MASCOTS'95, Durham, North Carolina, pages 307\u2013311. IEEE, 1995.","key":"21_CR13","DOI":"10.1109\/MASCOT.1995.378672"},{"doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd. Implementation of higher-order unification based on calculus of explicit substitutions. In M. Bartosek, J. Staudek, and J. Wiedermann, editors, Proc. SOFTSEM'95, pages 363\u2013368. Springer LNCS 1012, 1995.","key":"21_CR14","DOI":"10.1007\/3-540-60609-2_18"},{"key":"21_CR15","volume-title":"Controlling rewriting by rewriting","author":"P. Borovansk\u00fd","year":"1996","unstructured":"P. Borovansk\u00fd, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"key":"21_CR16","volume-title":"ELAN: A logical framework based on computational systems","author":"P. Borovansk\u00fd","year":"1996","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"unstructured":"G. Boudol. Computational semantics of term rewriting systems. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 169\u2013236. Cambridge University Press, 1985.","key":"21_CR17"},{"key":"21_CR18","volume-title":"An approach to solving binary CSP using computational systems","author":"C. Castro","year":"1996","unstructured":"C. Castro. An approach to solving binary CSP using computational systems. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"doi-asserted-by":"crossref","unstructured":"K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.","key":"21_CR19","DOI":"10.1007\/978-1-4613-9668-0_6"},{"unstructured":"A. Chien. Concurrent Aggregates. MIT Press, 1993.","key":"21_CR20"},{"key":"21_CR21","volume-title":"Distributed logic objects: a fragment of rewriting logic and its implementation","author":"A. Ciampolini","year":"1996","unstructured":"A. Ciampolini, E. Lamma, P. Mello, and C. Stefanelli. Distributed logic objects: a fragment of rewriting logic and its implementation. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"key":"21_CR22","volume-title":"Principles of Maude","author":"M. G. Clavel","year":"1996","unstructured":"Manuel G. Clavel, Steven Eker, Patrick Lincoln, and Jos\u00e9 Meseguer. Principles of Maude. To appear in Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"unstructured":"Manuel G. Clavel and Jos\u00e9 Meseguer. Axiomatizing reflective logics and languages. In Gregor Kiczales, editor, Proceedings of Reflection'96, San Francisco, California, April 1996, pages 263\u2013288. Xerox PARC, 1996.","key":"21_CR23"},{"key":"21_CR24","first-page":"368","volume":"936","author":"A. Corradini","year":"1995","unstructured":"A. Corradini and F. Gadducci. CPO models for infinite term rewriting. In Proc. AMAST'95, pages 368\u2013384. Springer LNCS 936, 1995.","journal-title":"Springer LNCS"},{"doi-asserted-by":"crossref","unstructured":"A. Corradini, F. Gadducci, and U. Montanari. Relating two categorical models of term rewriting. In J. Hsiang, editor, Proc. Rewriting Techniques and Applications, Kaiserslautern, pages 225\u2013240, 1995.","key":"21_CR25","DOI":"10.1007\/3-540-59200-8_59"},{"doi-asserted-by":"crossref","unstructured":"Andrea Corradini and Ugo Montanari. An algebra of graphs and graph rewriting. In D.H. Pitt et al., editor, Category Theory and Computer Science, pages 236\u2013260. Springer LNCS 530, 1991.","key":"21_CR26","DOI":"10.1007\/BFb0013469"},{"doi-asserted-by":"crossref","unstructured":"B. Courcelle. Graph rewriting: an algebraic and logic approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 193\u2013242. North-Holland, 1990.","key":"21_CR27","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"doi-asserted-by":"crossref","unstructured":"P. Degano, J. Meseguer, and U. Montanari. Axiomatizing net computations and processes. In Proc. LICS'89, pages 175\u2013185. IEEE, 1989.","key":"21_CR28","DOI":"10.1109\/LICS.1989.39172"},{"doi-asserted-by":"crossref","unstructured":"P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. To appear in Acta Informatica, 1996.","key":"21_CR29","DOI":"10.1007\/BF03036469"},{"doi-asserted-by":"crossref","unstructured":"G. Denker and M. Gogolla. Translating TROLL light concepts to Maude. In H. Ehrig and F. Orejas, editors, Recent Trends in Data Type Specification, volume 785 of LNCS, pages 173\u2013187. Springer-Verlag, 1994.","key":"21_CR30","DOI":"10.1007\/3-540-57867-6_10"},{"doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243\u2013320. North-Holland, 1990.","key":"21_CR31","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"21_CR32","volume-title":"Hidden sorted rewriting logic","author":"R. Diaconescu","year":"1996","unstructured":"R. Diaconescu. Hidden sorted rewriting logic. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph Grammars and their Application to Computer Science. Springer LNCS 532, 1991.","key":"21_CR33","DOI":"10.1007\/BFb0017372"},{"key":"21_CR34","volume-title":"Fast matching in combination of regular equational theories","author":"S. Eker","year":"1996","unstructured":"Steven Eker. Fast matching in combination of regular equational theories. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"unstructured":"J. Engelfriet, G. Leih, and G. Rozenberg. Parallel object-based systems and Petri nets, I and II. Technical Report 90-04,90-05, Dept. of Computer Science, University of Leiden, February 1990.","key":"21_CR35"},{"doi-asserted-by":"crossref","unstructured":"J. Engelfriet, G. Leih, and G. Rozenberg. Net-based description of parallel object-based systems, or POTs and POPs. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Foundations of Object-Oriented Languages, Noordwijkerhout, The Netherlands, May\/June 1990, pages 229\u2013273. Springer LNCS 489, 1991.","key":"21_CR36","DOI":"10.1007\/BFb0019446"},{"unstructured":"K. Futatsugi and T. Sawada. Cafe as an extensible specification environment. To appear in Proc. of the Kunming International CASE Symposium, Kunming, China, November, 1994.","key":"21_CR37"},{"unstructured":"F. Gadducci and U. Montanari. Enriched categories as models of computation. In Proc. 5th Italian Conference on Theoretical Computer Science, Ravello, 1995.","key":"21_CR38"},{"unstructured":"F. Giunchiglia, C.L. Pecchiari, and C. Talcott. Reasonig theories: towards an architecture for open mechanized reasoning systems. Technical Report 9409-15, IRST, University of Trento, November 1994.","key":"21_CR39"},{"key":"21_CR40","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J. Goguen","year":"1992","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105:217\u2013273, 1992. Originally given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983; several draft and technical report versions were circulated since 1985.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In J.W. de Bakker, G. Huizing, W. P. de Roever, and G. Rozenberg, editors, Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 1991.","key":"21_CR41","DOI":"10.1007\/BFb0031995"},{"unstructured":"ISO. IS8807: Information Processing Systems \u2014 Open System Interconnection \u2014 LOTOS \u2014 A formal description technique based on the temporal ordering of observational behavior. ISO, February 1989.","key":"21_CR42"},{"unstructured":"R. Jagannathan. Dataflow models. In E.Y. Zoyama, editor, Parallel and Distributed Computing Handbook, pages 223\u2013238. McGraw Hill, 1996.","key":"21_CR43"},{"unstructured":"R. Junglclaus, G. Saake, T. Hartmann, and C. Sernadas, editors. Object-oriented specification of information systems: the TROLL language. Technische Universit\u00e4t Braunschweig, Information-Berichte 91-04, 1991.","key":"21_CR44"},{"doi-asserted-by":"crossref","unstructured":"G.M. Kelly and R. Street. Review of the elements of 2-categories. In G.M. Kelly, editor, Category Seminar, Sydney 1972\/73, pages 75\u2013103. Springer Lecture Notes in Mathematics No. 420, 1974.","key":"21_CR45","DOI":"10.1007\/BFb0063101"},{"unstructured":"C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In V. Saraswat and P. van Hentryck, editors, Principles and Practice of Constraint Programming: The Newport Papers, pages 133\u2013160. MIT Press, 1995.","key":"21_CR46"},{"doi-asserted-by":"crossref","unstructured":"C. Kirchner and P. Viry. Implementing parallel rewriting. In B. Fronh\u00f6fer and G. Wrightson, editors, Parallelization in Inference Systems, pages 123\u2013138. Springer LNAI 590, 1992.","key":"21_CR47","DOI":"10.1007\/3-540-55425-4_5"},{"key":"21_CR48","volume-title":"Computational reflection and extension in ELAN","author":"H. Kirchner","year":"1996","unstructured":"H. Kirchner and P.-E. Moreau. Computational reflection and extension in ELAN. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"doi-asserted-by":"crossref","unstructured":"H. Kirchner and P.-E. Moreau. Prototyping completion with constraints using computational systems. In J. Hsiang, editor, Proc. Rewriting Techniques and Applications, Kaiserslautern, 1995.","key":"21_CR49","DOI":"10.1007\/3-540-59200-8_79"},{"unstructured":"P. Kosiuczenko and M. Wirsing. Timed rewriting logic, 1995. Working material for the 1995 Marktoberdorf International Summer School \u201cLogic of Computation\u201d.","key":"21_CR50"},{"key":"21_CR51","volume-title":"Discrete event systems in rewriting logic","author":"C. Landauer","year":"1996","unstructured":"C. Landauer. Discrete event systems in rewriting logic. To appear in Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"doi-asserted-by":"crossref","unstructured":"C. Laneve and U. Montanari. Axiomatizing permutation equivalence in the \u03bb-calculus. In H. Kirchner and G. Levi, editors, Proc. Third Int. Conf. on Algebraic and Logic Programming, Volterra, Italy, September 1992, volume 632 of LNCS, pages 350\u2013363. Springer-Verlag, 1992.","key":"21_CR52","DOI":"10.1007\/BFb0013837"},{"unstructured":"C. Laneve and U. Montanari. Axiomatizing permutation equivalence. Mathematical Structures in Computer Science, 1994. To appear.","key":"21_CR53"},{"key":"21_CR54","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F. W. Lawvere","year":"1963","unstructured":"F. William Lawvere. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences, 50:869\u2013873, 1963. Summary of Ph.D. Thesis, Columbia University.","journal-title":"Proceedings, National Academy of Sciences"},{"key":"21_CR55","volume-title":"Object-oriented specification of distributed systems in the \u039c-calculus and Maude","author":"U. Lechner","year":"1996","unstructured":"U. Lechner. Object-oriented specification of distributed systems in the \u039c-calculus and Maude. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"unstructured":"U. Lechner and C. Lengauer. Modal \u039c-Maude. To appear in Object Orientation with Parallelism and Persistence, B. Freitag, C.B. Jones, C. Lengauer and H.-J. Schek, editors, Kluwer, 1996.","key":"21_CR56"},{"unstructured":"U. Lechner, C. Lengauer, F. Nickl, and M. Wirsing. How to overcome the inheritance anomaly. To appear in Proc.ECOOP'96, Springer LNCS, 1996.","key":"21_CR57"},{"doi-asserted-by":"crossref","unstructured":"U. Lechner, C. Lengauer, and M. Wirsing. An object-oriented airport. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, Santa Margherita, Italy, May\/June 1994, pages 351\u2013367. Springer LNCS 906, 1995.","key":"21_CR58","DOI":"10.1007\/BFb0014438"},{"unstructured":"J. Levy. A higher order unification algorithm for bi-rewriting systems. In J. Agust\u00ed and P. Garc\u00eda, editors, Segundo Congreso Programaci\u00f3n Declarativa, pages 291\u2013305, Blanes, Spain, September 1993. CSIC.","key":"21_CR59"},{"key":"21_CR60","first-page":"17","volume-title":"volume 690 of LNCS","author":"J. Levy","year":"1993","unstructured":"J. Levy and J. Agust\u00ed. Bi-rewriting, a term rewriting technique for monotonic order relations. In C. Kirchner, editor, Proc. Fifth Int. Conf. on Rewriting Techniques and Applications, Montreal, Canada, June 1993, volume 690 of LNCS, pages 17\u201331. Springer-Verlag, 1993."},{"unstructured":"J.-J. L\u00e9vy. Optimal reductions in the lambda calculus. In J. P. Seldin and J. R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 159\u2013191. Academic Press, 1980.","key":"21_CR61"},{"doi-asserted-by":"crossref","unstructured":"Patrick Lincoln, Narciso Mart\u00ed-Oliet, and Jos\u00e9 Meseguer. Specification, transformation, and programming of concurrent systems in rewriting logic. In G.E. Blelloch, K.M. Chandy, and S. Jagannathan, editors, Specification of Parallel Algorithms, pages 309\u2013339. DIMACS Series, Vol. 18, American Mathematical Society, 1994.","key":"21_CR62","DOI":"10.1090\/dimacs\/018\/20"},{"key":"21_CR63","first-page":"37","volume":"817","author":"P. Lincoln","year":"1994","unstructured":"Patrick Lincoln, Narciso Mart\u00ed-Oliet, Jos\u00e9 Meseguer, and Livio Ricciulli. Compiling rewriting onto SIMD and MIMD\/SIMD machines. In Proceedings of PARLE'94, 6th International Conference on Parallel Architectures and Languages Europe, pages 37\u201348. Springer LNCS 817, 1994.","journal-title":"Springer LNCS"},{"key":"21_CR64","first-page":"509","volume":"854","author":"P. Lincoln","year":"1994","unstructured":"Patrick Lincoln, Jos\u00e9 Meseguer, and Livio Ricciulli. The Rewrite Rule Machine Node Architecture and its Performance. In Proceedings of CONPAR'94, Linz, Austria, September 1994, pages 509\u2013520. Springer LNCS 854, 1994.","journal-title":"Springer LNCS"},{"doi-asserted-by":"crossref","unstructured":"R.P. Lippmann. An introduction to computing with neural nets. IEEE ASSP Magazine, pages 4\u201322, April 1987.","key":"21_CR65","DOI":"10.1109\/MASSP.1987.1165576"},{"doi-asserted-by":"crossref","unstructured":"The Chemical Abstract Machine. G\u00e9rard Berry and G\u00e9rard Boudol. In Proc. POPL'90, pages 81\u201394. ACM, 1990.","key":"21_CR66","DOI":"10.1145\/96709.96717"},{"unstructured":"Saunders MacLane. Categories for the working mathematician. Springer-Verlag, 1971.","key":"21_CR67"},{"unstructured":"Narciso Mart\u00ed-Oliet and Jos\u00e9 Meseguer. Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, August 1993. To appear in D. Gabbay, ed., Handbook of Philosophical Logic, Oxford University Press.","key":"21_CR68"},{"doi-asserted-by":"crossref","unstructured":"Narciso Mart\u00ed-Oliet and Jos\u00e9 Meseguer. General logics and logical frameworks. In D. Gabbay, editor, What is a Logical System?, pages 355\u2013392. Oxford University Press, 1994.","key":"21_CR69","DOI":"10.1093\/oso\/9780198538592.003.0014"},{"unstructured":"Narciso Mart\u00ed-Oliet and Jos\u00e9 Meseguer. Action and change in rewriting logic. In R. Pareschi and B. Fronhoefer, editors, Theoretical Approaches to Dynamic Worlds in Artificial Intelligence and Computer Science. 1996. To be published by Kluwer Academic Publisher.","key":"21_CR70"},{"doi-asserted-by":"crossref","unstructured":"Satoshi Matsuoka and Akinori Yonezawa. Analysis of inheritance anomaly in object-oriented concurrent programming languages. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 107\u2013150. MIT Press, 1993.","key":"21_CR71","DOI":"10.7551\/mitpress\/2087.003.0007"},{"key":"21_CR72","first-page":"101","volume-title":"A logical theory of concurrent objects","author":"J. Meseguer","year":"1990","unstructured":"Jos\u00e9 Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA '90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990, pages 101\u2013115. ACM, 1990."},{"key":"21_CR73","first-page":"384","volume":"458","author":"J. Meseguer","year":"1990","unstructured":"Jos\u00e9 Meseguer. Rewriting as a unified model of concurrency. In Proceedings of the Concur'90 Conference, Amsterdam, August 1990, pages 384\u2013400. Springer LNCS 458, 1990.","journal-title":"Springer LNCS"},{"unstructured":"Jos\u00e9 Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Revised June 1990.","key":"21_CR74"},{"issue":"1","key":"21_CR75","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Jos\u00e9 Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73\u2013155, 1992.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 314\u2013390. MIT Press, 1993.","key":"21_CR76","DOI":"10.7551\/mitpress\/2087.003.0017"},{"doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. Solving the inheritance anomaly in concurrent object-oriented programming. In Oscar M. Nierstrasz, editor, Proc. ECOOP'93, pages 220\u2013246. Springer LNCS 707, 1993.","key":"21_CR77","DOI":"10.1007\/3-540-47910-4_13"},{"key":"21_CR78","first-page":"61","volume-title":"Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents","author":"J. Meseguer","year":"1992","unstructured":"Jos\u00e9 Meseguer, Kokichi Futatsugi, and Timothy Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the 1992 International Symposium on New Models for Software Architecture, Tokyo, Japan, November 1992, pages 61\u2013106. Research Institute of Software Engineering, 1992."},{"issue":"1","key":"21_CR79","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/inco.1993.1016","volume":"103","author":"J. Meseguer","year":"1993","unstructured":"Jos\u00e9 Meseguer and Joseph Goguen. Order-sorted algebra solves the constructorselector, multiple representation and coercion problems. Information and Computation, 103(1):114\u2013158, 1993.","journal-title":"Information and Computation"},{"key":"21_CR80","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"Jos\u00e9 Meseguer and Ugo Montanari. Petri nets are monoids. Information and Computation, 88:105\u2013155, 1990.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer and Xiaolei Qian. A logical semantics for object-oriented databases. In Proc. International SIGMOD Conference on Management of Data, pages 89\u201398. ACM, 1993.","key":"21_CR81","DOI":"10.1145\/170035.170057"},{"unstructured":"Jos\u00e9 Meseguer and Carolyn Talcott. Reasoning theories and rewriting logic. Manuscript, Stanford University, June 1996.","key":"21_CR82"},{"doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer and Timothy Winkler. Parallel programming in Maude. In J.-P. Ban\u00e2tre and D. Le M\u00e8tayer, editors, Research Directions in High-level Parallel Programming Languages, pages 253\u2013293. Springer LNCS 574, 1992. Also Technical Report SRI-CSL-91-08, SRI International, Computer Science Laboratory, November 1991.","key":"21_CR83","DOI":"10.1007\/3-540-55160-3_49"},{"issue":"2","key":"21_CR84","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Robin Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119\u2013141, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"21_CR85","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545\u2013596, 1995.","journal-title":"Acta Informatica"},{"unstructured":"K. Ohmaki, K. Futatsugi, and K. Takahashi. A basic LOTOS simulator in OBJ. In Proceedings of the International Conference of Information Technology Commemorating the 30th Anniversary of the Information Processing Society of Japan (InfoJapan'90), pages 497\u2013504. IPSJ, October 1990.","key":"21_CR86"},{"doi-asserted-by":"crossref","unstructured":"Peter Csaba \u00f6lveczky, Piotr Kosiuczenko, and Martin Wirsing. An objectoriented algebraic steam-boiler control specification. In Jean-Raymond Abrial, Egon B\u00f6rger, and Hans Langmaack, editors, The Steam-Boiler Case Study Book. Springer-Verlag, 1996. To appear.","key":"21_CR87","DOI":"10.1007\/BFb0027246"},{"unstructured":"Peter Csaba \u00f6lveczky and Jos\u00e9 Meseguer. Specifying real-time systems in rewriting logic. Paper in preparation.","key":"21_CR88"},{"key":"21_CR89","volume-title":"A Maude specification of an object oriented database model for telecomunication networks","author":"I. Pita","year":"1996","unstructured":"Isabel Pita and Narciso Mart\u00ed-Oliet. A Maude specification of an object oriented database model for telecomunication networks. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"doi-asserted-by":"crossref","unstructured":"J.-C. Raoult and F. Voisin. Set-theoretic graph rewriting. In H.-J. Schneider and H. Ehrig, editors, Graph Transformations in Computer Science, pages 312\u2013325. Springer LNCS 776, 1994.","key":"21_CR90","DOI":"10.1007\/3-540-57787-4_20"},{"doi-asserted-by":"crossref","unstructured":"H. Reichel. An approach to object semantics based on terminal co-algebras. To appear in Mathematical Structures in Computer Science, 1995. Presented at Dagstuhl Seminar on Specification and Semantics, Schloss Dagstuhl, Germany, May 1993.","key":"21_CR91","DOI":"10.1017\/S0960129500000694"},{"unstructured":"G. Saake and A. Sernadas, editors. Information Systems\u2014Correctness and Reusability. Technische Universit\u00e4t Braunschweig, Information-Berichte 91-03, 1991.","key":"21_CR92"},{"unstructured":"Vladimiro Sassone, Jos\u00e9 Meseguer, and Ugo Montanari. Inductive completion of monoidal categories and infinite net computations. Submitted for publication.","key":"21_CR93"},{"doi-asserted-by":"crossref","unstructured":"H.-J. Schneider and H. Ehrig, editors. Graph Transformations in Computer Science. Springer LNCS 776, 1994.","key":"21_CR94","DOI":"10.1007\/3-540-57787-4"},{"key":"21_CR95","volume-title":"Bi-rewriting rewriting logic","author":"M. Schorlemmer","year":"1996","unstructured":"M. Schorlemmer. Bi-rewriting rewriting logic. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"key":"21_CR96","volume-title":"Technical report","author":"W. Schreiner","year":"1993","unstructured":"Wolfgang Schreiner. Parallel functional programming: an annotated bibliography. Technical report, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1993."},{"unstructured":"M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. vanEekelen, editors. Term Graph Rewriting. Wiley, 1993.","key":"21_CR97"},{"unstructured":"J.G. Stell. Modelling term rewriting systems by sesqui-categories. Technical Report TR94-02, Keele University, 1994. Also in shorter form in Proc. C.A.E.N., 1994, pp. 121\u2013127.","key":"21_CR98"},{"key":"21_CR99","volume-title":"An actor rewrite theory","author":"C. L. Talcott","year":"1996","unstructured":"C. L. Talcott. An actor rewrite theory. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"doi-asserted-by":"crossref","unstructured":"C. L. Talcott. Interaction semantics for components of distributed systems. In 1 st IFIP Workshop on Formal Methods for Open Object-based Distributed Systems, FMOODS'96, 1996.","key":"21_CR100","DOI":"10.1007\/978-0-387-35082-0_11"},{"key":"21_CR101","volume-title":"Input\/output for ELAN","author":"P. Viry","year":"1996","unstructured":"P. Viry. Input\/output for ELAN. To appear in Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"key":"21_CR102","first-page":"648","volume-title":"volume 817 of LNCS","author":"P. Viry","year":"1994","unstructured":"P. Viry. Rewriting: An effective model of concurrency. In C. Halatsis et al., editors, PARLE'94, Proc. Sixth Int. Conf. on Parallel Architectures and Languages Europe, Athens, Greece, July 1994, volume 817 of LNCS, pages 648\u2013660. Springer-Verlag, 1994."},{"key":"21_CR103","volume-title":"PhD thesis","author":"M. Vittek","year":"1994","unstructured":"M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit\u00e9 Henry Poincar\u00e9 \u2014 Nancy I, 1994."},{"unstructured":"M. Walicki and S. Meldal. Algebraic approaches to nondeterminism\u2014an overview. To appear in Computing Surveys.","key":"21_CR104"},{"key":"21_CR105","volume-title":"A formal approach to object-oriented software enginering","author":"M. Wirsing","year":"1996","unstructured":"M. Wirsing. A formal approach to object-oriented software enginering. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996."},{"unstructured":"M. Wirsing, F. Nickl, and U. Lechner. Concurrent object-oriented design specification in SPECTRUM. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t M\u00fcnchen, 1995.","key":"21_CR106"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:23:13Z","timestamp":1742599393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":106,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}