{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:03:33Z","timestamp":1725494613759},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421214"},{"type":"electronic","value":"9783540451327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45132-3_12","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T12:00:06Z","timestamp":1194955206000},"page":"190-201","source":"Crossref","is-referenced-by-count":1,"title":["JC-Nets"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Ciobanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Rotaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"G. Ciobanu, M. Rotaru.\u201cFaithful \u03c0-nets.A Graphical Representation of the Asynchronous \u03c0-calculus\u201d, ENTCS, vol.18, 22 p, North-Holland, 1998.","DOI":"10.1016\/S1571-0661(05)80248-8"},{"issue":"1","key":"12_CR2","first-page":"39","volume":"6","author":"G. Ciobanu","year":"2000","unstructured":"G. Ciobanu, M. Rotaru. \u201cA \u03c0-calculus Machine\u201d. In Journal of Universal Computer Science, vol.6(1), 39\u201359, Springer, 2000.","journal-title":"Journal of Universal Computer Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier. \u201cThe Reflexive CHAM and the Join Calculus\u201d.In Proc. POPL\u201996, ACM Press, 1996.","DOI":"10.1145\/237721.237805"},{"key":"12_CR4","unstructured":"C. Fournet. \u201cThe Join-Calculus: A calculus for Distributed Mobile Programming\u201d, PhD thesis, INRIA Rocquencourt, 1998."},{"key":"12_CR5","series-title":"PhD thesis","volume-title":"Description and Verification of Mobile Processes with Graph Rewriting Techniques","author":"Kon99.B. K\u00f6nig","year":"1999","unstructured":"Kon99.B. K\u00f6nig. \u201cDescription and Verification of Mobile Processes with Graph Rewriting Techniques\u201d, PhD thesis, Technische Universit\u00e4t M\u00fcnchen, 1999."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BFb0014554","volume-title":"In Proc.TACS\u201997","author":"Lev98.J. J. L\u00e9vy","year":"1997","unstructured":"Lev98.J. J. L\u00e9vy. \u201cSome Results in the Join Calculus\u201d.In Proc.TACS\u201997, LNCS vol.1281, Springer, 233\u2013249, 1997."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"A. Mifsud, R. Milner, A.J. Parrow. \u201cControl Structures\u201d,.In Proc. LICS\u201995.","DOI":"10.1109\/LICS.1995.523256"},{"key":"12_CR8","unstructured":"A. Mifsud.PhD thesis, University of Edinburgh, 1996."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"R. Milner. \u201cThe Polyadic p-calculus: a Tutorial\u201d.In Logic and Algebra of Specification, Springer, 203\u2013246, 1993.","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-57880-3_2","volume-title":"Proc. ESOP\u201994","author":"R. Milner","year":"1994","unstructured":"R. Milner. \u201c \u03c0-nets: a Graphical Form of \u03c0-calculus\u201d.In Proc. ESOP\u201994, LNCS 788, Springer, 26\u201342, 1994."},{"issue":"8","key":"12_CR11","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"R. Milner. \u201cCalculi for Interaction\u201d, Acta Informatica 33 (8), 707\u2013737, 1996.","journal-title":"Acta Informatica"},{"key":"12_CR12","unstructured":"Mil99.R. Milner. Communicating and Mobile Systems: the \u03c0-calculus, Cambridge University Press, 1999."}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45132-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:10:10Z","timestamp":1556950210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45132-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421214","9783540451327"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45132-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}