{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T12:10:01Z","timestamp":1737375001457,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_30","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:26:08Z","timestamp":1187252768000},"page":"373-384","source":"Crossref","is-referenced-by-count":5,"title":["A General Framework for Types in Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"issue":"3\/4","key":"30_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3\/4):241\u2013265, 1996.","journal-title":"Fundamenta Informaticae"},{"key":"30_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Introduction to the algebraic theory of graphs","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig. Introduction to the algebraic theory of graphs. In Proc. 1st International Workshop on Graph Grammars, pages 1\u201369. Springer-Verlag, 1979. LNCS 73."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.","DOI":"10.1142\/4181"},{"key":"30_CR4","unstructured":"F. Gadducci and U. Montanari. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science, 2000. to appear."},{"key":"30_CR5","unstructured":"Philippa Gardner. Closed action calculi. Theoretical Computer Science (in association with the conference on Mathematical Foundations in Programming Semantics), 1998."},{"key":"30_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Annegret Habel. Hyperedge Replacement: Grammars and Languages. Springer-Verlag, 1992. LNCS 643."},{"key":"30_CR7","unstructured":"Masahito Hasegawa. Models of Sharing Graphs (A Categorical Semantics of Let and Letrec). PhD thesis, University of Edingburgh, 1997. available in Springer Distinguished Dissertation Series."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Kohei Honda. Composing processes. In Proc. of POPL\u201996, pages 344\u2013357. ACM, 1996.","DOI":"10.1145\/237721.237802"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Atsushi Igarashi, Benjamin Pierce, and Philip Wadler. Featherweight Java: A core calculus for Java and GJ. In Proc. of OOPSLA 1999, 1999.","DOI":"10.1145\/320384.320395"},{"key":"30_CR10","series-title":"Lect Notes Comput Sci","first-page":"352","volume-title":"Generating type systems for process graphs","author":"B. K\u00f6nig","year":"1999","unstructured":"Barbara K\u00f6nig. Generating type systems for process graphs. In Proc. of CONCUR\u2019 99, pages 352\u2013367. Springer-Verlag, 1999. LNCS 1664."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Barbara K\u00f6nig. A general framework for types in graph rewriting. Technical Report TUM-I0014, Technische Universit\u00e4t M\u00fcnchen, 2000.","DOI":"10.1007\/3-540-44450-5_30"},{"key":"30_CR12","unstructured":"Barbara K\u00f6nig. A graph rewriting semantics for the polyadic pi-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops 2000, pages 451\u2013458. Carleton Scientific, 2000."},{"key":"30_CR13","unstructured":"Barbara K\u00f6nig. Hypergraph construction and its application to the compositional modelling of concurrency. In GRATRA 2000: Joint APPLIGRAPH\/GETGRATS Workshop on Graph Transformation Systems, 2000."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Yves Lafont. Interaction nets. In Proc. of POPL\u2019 90, pages 95\u2013108. ACM Press, 1990.","DOI":"10.1145\/96709.96718"},{"key":"30_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Deriving bisimulation congruences for reactive systems","author":"J. J. Leifer","year":"2000","unstructured":"James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, 2000. LNCS 1877."},{"key":"30_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"Concurrency Theory","author":"J. Meseguer","year":"1996","unstructured":"Jos\u00e9 Meseguer. Rewriting logic as a semantic framework for concurrency: A progress report. In Concurrency Theory, pages 331\u2013372. Springer-Verlag, 1996. LNCS 1119."},{"key":"30_CR17","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Robin Milner. The polyadic \u03c0-calculus: a tutorial. In F. L. Hamer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, Heidelberg, 1993."},{"issue":"8","key":"30_CR18","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"Robin Milner. Calculi for interaction. Acta Informatica, 33(8):707\u2013737, 1996.","journal-title":"Acta Informatica"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Proc. of LICS\u2019 93, pages 376\u2013385, 1993.","DOI":"10.1109\/LICS.1993.287570"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/inco.1995.1018","volume":"116","author":"D. Walker","year":"1995","unstructured":"David Walker. Objects in the \u03c0-calculus. Information and Computation, 116:253\u2013271, 1995.","journal-title":"Information and Computation"},{"key":"30_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Graph notation for concurrent combinators","author":"N. Yoshida","year":"1995","unstructured":"Nobuko Yoshida. Graph notation for concurrent combinators. In Proc. of TPPP\u2019 94. Springer-Verlag, 1994. LNCS 907."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:30:20Z","timestamp":1737372620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}