{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:18:57Z","timestamp":1725495537746},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664253"},{"type":"electronic","value":"9783540483205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48320-9_25","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T13:52:42Z","timestamp":1195134762000},"page":"354-367","source":"Crossref","is-referenced-by-count":3,"title":["Generating Type Systems for Process Graphs"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Mart\u00edn Abadi. Secrecy by typing in security protocols. In Theoretical Aspects of Computer Software, pages 611\u2013638. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0014571"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Michel Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83\u2013127, 1987.","journal-title":"Mathematical Systems Theory"},{"key":"25_CR3","doi-asserted-by":"publisher","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:217\u2013248, 1992.","journal-title":"Theoretical Computer Science"},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BFb0055617","volume-title":"CONCUR\u2019 98","author":"C. Bodei","year":"1998","unstructured":"Chiara Bodei, Pierpaolo Degano, Flemming Nielson, and Hanne Riis Nielson. Control flow analysis for the pi-calculus. In CONCUR\u2019 98, pages 84\u201398. SpringerVerlag, 1998. LNCS 1466."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Roy L. Crole. Categories for Types. Cambridge University Press, 1993.","DOI":"10.1017\/CBO9781139172707"},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 1st International Workshop on Graph Grammars","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":"25_CR7","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. SpringerVerlag, 1992. LNCS 643."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Kohei Honda. Composing processes. In Proc. of POPL\u201996, pages 344\u2013357. ACM Press, 1996.","DOI":"10.1145\/237721.237802"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Kohei Honda and Nobuko Yoshida. Combinatory representation of mobile processes. In POPL\u2019 94, pages 348\u2013360. ACM Press, 1994.","DOI":"10.1145\/174675.177953"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Naoki Kobayashi. A partially deadlock-free typed process calculus. In LICS\u2019 97, pages 128\u2013139. IEEE, Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614941"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In POPL\u2019 96, pages 358\u2013371. ACM SIGACT\/SIGPLAN, 1996.","DOI":"10.1145\/237721.237804"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Yves Lafont. Interaction nets. In POPL\u2019 90, pages 95\u2013108. ACM Press, 1990.","DOI":"10.1145\/96709.96718"},{"key":"25_CR13","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part I. Tech. Rep. ECS-LFCS-89-85, University of Edinburgh, Laboratory for Foundations of Computer Science, 1989."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Robin Milner. Operational and algebraic semantics of concurrent processes. In Jan van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, volume B, pages 1201\u20131242. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"25_CR15","unstructured":"Robin Milner. The polyadic \u03c0-calculus: a tutorial. Tech. Rep. ECS-LFCS-91-180, University of Edinburgh, Laboratory for Foundations of Computer Science, 1991."},{"key":"25_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-57880-3_2","volume-title":"European Symposium on Programming","author":"R. Milner","year":"1994","unstructured":"Robin Milner. Pi-nets: a graphical form of pi-calculus. In European Symposium on Programming, pages 26\u201342. Springer-Verlag, 1994. LNCS 788."},{"key":"25_CR17","unstructured":"Uwe Nestmann and Martin Ste\u00e9n. Typing confluence. In ERCIM Workshop on Formal Methods in Industrial Critical Systems, pages 77\u2013101, 1997."},{"key":"25_CR18","first-page":"407","volume":"2","author":"J. Parrow","year":"1995","unstructured":"Joachim Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407\u2013443, 1995.","journal-title":"Nordic Journal of Computing"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In LICS\u2019 93, pages 376\u2013385, 1993.","DOI":"10.1109\/LICS.1993.287570"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Antonio Ravara and Vasco T. Vasconcelos. Behavioural types for a calculus of concurrent objects. In Euro-Par\u2019 97. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0002782"},{"key":"25_CR21","unstructured":"David Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1995. ECS-LFCS-96\u2013345."},{"key":"25_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Mathematical Foundations of Computer Science 1995","author":"P. Urzyczyn","year":"1995","unstructured":"P. Urzyczyn. Positive recursive type assignment. In J. Wiedermann and P. H\u00e1jek, editors, Mathematical Foundations of Computer Science 1995. Springer-Verlag, 1995. LNCS 969."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Nobuko Yoshida. Graph types for monadic mobile processes. In FST\/TCS\u2019 96, pages 371\u2013386. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62034-6_64"}],"container-title":["Lecture Notes in Computer Science","CONCUR\u201999 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48320-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T13:06:57Z","timestamp":1556975217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48320-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664253","9783540483205"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-48320-9_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}