{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:12:44Z","timestamp":1794348764755,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540738572","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73859-6_15","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:37:02Z","timestamp":1187681822000},"page":"209-225","source":"Crossref","is-referenced-by-count":6,"title":["Graphical Encoding of a Spatial Logic for the \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Lluch Lafuente","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proceedings of WADT 2006 (Workshop on Algebraic Development Techniques)","author":"P. Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Lluch Lafuente, A.: A temporal graph logic for verification of graph transformation systems. In: Fiadeiro, J.L., Schobbens, P.-Y. (eds.) Proceedings of WADT 2006 (Workshop on Algebraic Development Techniques). LNCS, vol.\u00a04409, pp. 1\u201320. Springer, Heidelberg (2007)"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(01)00318-8","volume":"286","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theor. Comp. Sci.\u00a0286(2), 247\u2013292 (2002)","journal-title":"Theor. Comp. Sci."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-24727-2_7","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Caires","year":"2004","unstructured":"Caires, L.: Behavioral and spatial observations in a logic for the \u03c0-calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 72\u201387. Springer, Heidelberg (2004)"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0890-5401(03)00137-8","volume":"186","author":"L. Caires","year":"2003","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Information and Computation\u00a0186(2), 194\u2013235 (2003)","journal-title":"Information and Computation"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-36576-1_14","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Cardelli","year":"2003","unstructured":"Cardelli, L., Fiore, M., Winskel, G.: Manipulating trees with hidden labels. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol.\u00a02620, pp. 216\u2013232. Springer, Heidelberg (2003)"},{"key":"15_CR7","unstructured":"Cardelli, L., Gordon, A.D.: Ambient logic. Forthcoming issue of Mathematical Structures in Computer Science (2007)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1007\/11523468_62","volume-title":"Automata, Languages and Programming","author":"G. Conforti","year":"2005","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: Spatial logics for bigraphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 766\u2013778. Springer, Heidelberg (2005)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1008647417502","volume":"7","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Gadducci, F.: An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures\u00a07(4), 299\u2013331 (1999)","journal-title":"Applied Categorical Structures"},{"issue":"3\/4","key":"15_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026(3\/4), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In [24], pp. 163\u2013245","DOI":"10.1142\/9789812384720_0003"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In [24], pp. 313\u2013400","DOI":"10.1142\/9789812384720_0005"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars. In [24], pp. 95\u2013162","DOI":"10.1142\/9789812384720_0002"},{"issue":"3-5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-40018-9_4","volume-title":"Programming Languages and Systems","author":"F. Gadducci","year":"2003","unstructured":"Gadducci, F.: Term graph rewriting and the \u03c0-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 37\u201354. Springer, Heidelberg (2003)"},{"key":"15_CR16","series-title":"El. Notes in Theor. Comp. Sci","volume-title":"Graph Transformation for Verification and Concurrency","author":"F. Gadducci","year":"2007","unstructured":"Gadducci, F., Lluch Lafuente, A.: Graphical verification of a spatial logic for the \u03c0-calculus. In: Heckel, R., K\u00f6nig, B., Rensink, A. (eds.) Graph Transformation for Verification and Concurrency. El. Notes in Theor. Comp. Sci, Elsevier, Amsterdam (2007)"},{"key":"15_CR17","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1308\/147363505X39437","volume":"87","author":"V. Kozioura","year":"2005","unstructured":"Kozioura, V., K\u00f6nig, B.: AUGUR: A tool for the analysis of graph transformation systems. Bulletin of EATCS\u00a087, 126\u2013137 (2005)","journal-title":"Bulletin of EATCS"},{"key":"15_CR18","volume-title":"Communicating and Mobile Systems: The \u03c0-calculus","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Communicating and Mobile Systems: The \u03c0-calculus. Cambridge University Press, Cambridge (1992)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE simulator: A tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 479\u2013485. Springer, Heidelberg (2004)"},{"key":"15_CR21","unstructured":"Rensink, A.: Towards model checking graph grammars. In: Leuschel, M., Gruner, S., Lo\u00a0Presti, S., (eds.) Automated Verification of Critical Systems, vol. DSSE\u2013TR\u20132003\u20132 of University of Southampton Technical Reports, pp. 150\u2013160. University of Southampton (2003)"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0022-0000(85)90003-0","volume":"30","author":"J. Reif","year":"1985","unstructured":"Reif, J., Sistla, A.P.: A multiprocess network logic with temporal and spatial modalities. Journal of Computer and System Sciences\u00a030(1), 41\u201353 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR23","first-page":"55","volume-title":"Logic in Computer Science","author":"J. Reynolds","year":"2002","unstructured":"Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science, pp. 55\u201374. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"15_CR24","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1997","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01. World Scientific, Singapore (1997)"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10270-003-0050-x","volume":"3","author":"D. Varr\u00f3","year":"2004","unstructured":"Varr\u00f3, D.: Automated formal verification of visual modeling languages by model checking. Software and Systems Modeling\u00a03(2), 85\u2013113 (2004)","journal-title":"Software and Systems Modeling"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73859-6_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:16:52Z","timestamp":1605745012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73859-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738572"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6","asserted-by":"object"}]},"subject":[]}}