{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:46Z","timestamp":1725467386350},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_90","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"225-239","source":"Crossref","is-referenced-by-count":3,"title":["Process specification and verification"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Barthelmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/83880.84528","volume":"33","author":"G. Agha","year":"1990","unstructured":"G. Agha: Concurrent Object-oriented Programming. Communications of the ACM 33(3), 125\u2013141 (1990)","journal-title":"Communications of the ACM"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewritings. Mathematical Systems Theory 20, 83\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0022-0000(87)90030-4","volume":"34","author":"P. B\u00f6hm","year":"1987","unstructured":"P. B\u00f6hm, H.-R. Fonio, A. Habel: Amalgamation of Graph Transformations: A Synchronization Mechanism. Journal of Computer and System Sciences 34, 377\u2013408 (1987)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"16_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/23005.24038","volume":"34","author":"P. Degano","year":"1987","unstructured":"P. Degano, U. Montanari: A Model for Distributed Systems Based on Graph Rewriting. Journal of the ACM 34(2), 411\u2013449 (1987)","journal-title":"Journal of the ACM"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(93)90354-V","volume":"110","author":"A. Habel","year":"1993","unstructured":"A. Habel, H.-J. Kreowski, C. Lautemann: A comparison of compatible, finite, and inductive graph properties. Theoretical Computer Science 110, 145\u2013168 (1993)","journal-title":"Theoretical Computer Science"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall 1985","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"F. Kr\u00f6ger: Temporal Logic of Programs. Springer 1987","DOI":"10.1007\/978-3-642-71549-5"},{"key":"16_CR8","unstructured":"R. Milner: Communication and Concurrency. Prentice Hall 1989"},{"key":"16_CR9","first-page":"1","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, D. Walker: A Calculus of Mobile Processes I & II. Information and Control 100, 1\u201377 (1992)","journal-title":"Information and Control"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"V. Nguyen, A. Demers, D. Gries, S. Owicki: Behavior: a Temporal Approach to Process Modelling. In: R. Parikh (Ed.): Logics of Programs. Lecture Notes in Computer Science 193 (1985)","DOI":"10.1007\/3-540-15648-8_19"},{"key":"16_CR11","unstructured":"G. Schied: \u00dcber Graphgrammatiken, eine Spezifikationsmethode f\u00fcr Programmiersprachen und verteilte Regelsysteme. Dissertation. Arbeitsberichte des IMMD 25, 2, Universit\u00e4t Erlangen-N\u00fcrnberg 1992"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B. Thomsen","year":"1993","unstructured":"B. Thomsen: Plain CHOCS A second generation calculus for higher order processes. Acta Informatica 30, 1\u201359 (1993)","journal-title":"Acta Informatica"},{"issue":"3","key":"16_CR13","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/129393.129396","volume":"14","author":"J. Widom","year":"1992","unstructured":"J. Widom, D. Gries, F. B. Schneider: Trace-Based Network Proof Systems: Expressiveness and Completeness. ACM Transactions on Programming Languages and Systems 14(3), 396\u2013416 (1992)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_90","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:02:05Z","timestamp":1555711325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}