{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:45:30Z","timestamp":1779896730615,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662459164","type":"print"},{"value":"9783662459171","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45917-1_2","type":"book-chapter","created":{"date-parts":[[2014,12,22]],"date-time":"2014-12-22T14:34:17Z","timestamp":1419258857000},"page":"17-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding a Forest in a Tree"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Bacci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marino","family":"Miculan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bacci, G., Grohmann, D., Miculan, M.: Bigraphical models for protein and membrane interactions. In: Ciobanu, G. (ed.) Proc. MeCBIC. Electronic Proceedings in Theoretical Computer Science, vol. 11, pp. 3\u201318 (2009)","DOI":"10.4204\/EPTCS.11.1"},{"key":"2_CR2","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R.: Term rewriting systems. CUP (2003)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: Proc. STOC 2007, pp. 67\u201374. ACM (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-70575-8_46","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On Problems without Polynomial Kernels (Extended Abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563\u2013574. Springer, Heidelberg (2008)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-68863-1_3","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"M Boreale","year":"2008","unstructured":"Boreale, M., Bruni, R., De Nicola, R., Loreti, M.: Sessions and Pipelines for Structured Service Programming. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 19\u201338. Springer, Heidelberg (2008)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140\u2013155. Springer, Heidelberg (1998)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. STOC 1971, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00165-011-0184-5","volume":"25","author":"TC Damgaard","year":"2013","unstructured":"Damgaard, T.C., Glenstrup, A.J., Birkedal, L., Milner, R.: An inductive characterization of matching in binding bigraphs. Formal Aspects of Computing 25(2), 257\u2013288 (2013)","journal-title":"Formal Aspects of Computing"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"D\u00f6rr, H.: Efficient graph rewriting and its implementation, vol. 922. LNCS. Springer (1995)","DOI":"10.1007\/BFb0031909"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11804192_2","volume-title":"Formal Methods for Components and Objects","author":"G-L Ferrari","year":"2006","unstructured":"Ferrari, G.-L., Hirsch, D., Lanese, I., Montanari, U., Tuosto, E.: Synchronised Hyperedge Replacement as a Model for Service Oriented Computing. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 22\u201343. Springer, Heidelberg (2006)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0020-0190(71)90019-6","volume":"1","author":"JE Hopcroft","year":"1971","unstructured":"Hopcroft, J.E., Tarjan, R.E.: A v$$^2$$ algorithm for determining isomorphism of planar graphs. Inf. Process. Lett. 1(1), 32\u201334 (1971)","journal-title":"Inf. Process. Lett."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs (preliminary report). In: Proc. STOC 1974, pp. 172\u2013184. ACM (1974)","DOI":"10.1145\/800119.803896"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and transitions. In: Proc. POPL, pp. 38\u201349. ACM (2003)","DOI":"10.1145\/640128.604135"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Krivine, J., Milner, R., Troina, A.: Stochastic bigraphs. In: Proc. MFPS. Electronic Notes in Theoretical Computer Science, vol. 218, pp. 73\u201396 (2008)","DOI":"10.1016\/j.entcs.2008.10.006"},{"key":"2_CR16","unstructured":"Mansutti, A., Miculan, M., Peressotti, M.: Towards distributed bigraphical reactive systems. In: Echahed, R., Habel, A., Mosbah, M. (eds.) Proc. GCM 2014, p. 45 (2014)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-5060(08)70324-8","volume":"2","author":"DW Matula","year":"1978","unstructured":"Matula, D.W.: Subtree isomorphism in $$\\mathop {O}(n^{5\/2})$$. Annals of Discrete Mathematics 2, 91\u2013106 (1978)","journal-title":"Annals of Discrete Mathematics"},{"key":"2_CR18","unstructured":"Miculan, M., Peressotti, M.: A CSP implementation of the bigraph embedding problem. In: Proc. 1st International Workshop on Meta Models for Process Languages (MeMo) (2014)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Milner, R.: The Space and Motion of Communicating Agents. CUP (2009)","DOI":"10.1017\/CBO9780511626661"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ic.2008.03.026","volume":"207","author":"T-F Serbanuta","year":"2009","unstructured":"Serbanuta, T.-F., Rosu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Inf. Comput. 207(2), 305\u2013340 (2009)","journal-title":"Inf. Comput."},{"key":"2_CR21","unstructured":"Sevegnani, M., Unsworth, C., Calder, M.: A SAT based algorithm for the matching problem in bigraphs with sharing. Technical Report TR-2010-311, Department of Computer Science, University of Glasgow (2010)"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45917-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T01:23:23Z","timestamp":1675128203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-45917-1_2"}},"subtitle":["The Matching Problem for Wide Reactive Systems"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662459164","9783662459171"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45917-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"23 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}