{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:12:47Z","timestamp":1771045967384,"version":"3.50.1"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.<\/jats:p>","DOI":"10.1007\/s00165-011-0184-5","type":"journal-article","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T19:18:24Z","timestamp":1310671104000},"page":"257-288","source":"Crossref","is-referenced-by-count":9,"title":["An inductive characterization of matching in binding bigraphs"],"prefix":"10.1145","volume":"25","author":[{"given":"Troels C.","family":"Damgaard","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne J.","family":"Glenstrup","sequence":"additional","affiliation":[{"name":"IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[{"name":"IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Milner","sequence":"additional","affiliation":[{"name":"The Computer Laboratory, University of Cambridge, CB3 0FD, Cambridge, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","unstructured":"Birkedal L Bundgaard M Damgaard TC Debois S Elsborg E Glenstrup AJ Hildebrandt TT Milner R Niss H (2006) Bigraphical programming languages for pervasive computing. In: Strang T Cahill V Quigley A (eds) Proceedings of Pervasive 2006 International Workshop on Combining Theory and Systems Building in Pervasive Computing pp 653\u2013658"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Birkedal L Debois S Elsborg E Hildebrandt TT Niss H (2006) Bigraphical models of context-aware systems. In: Aceto L Ing\u00f3lfsd\u00f3ttir A (eds) Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structure. Lecture Notes in Computer Science vol 3921. Springer Berlin pp 187\u2013201","DOI":"10.1007\/11690634_13"},{"key":"e_1_2_1_2_3_2","unstructured":"Birkedal L Damgaard TC Glenstrup AJ Milner R (2006) Matching of bigraphs. In: Proceedings of Graph Transformation for Verification and Concurrency Workshop 2006 Electronic Notes in Theoretical Computer Science. Elsevier Amsterdam"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Birkedal L Debois S Hildebrandt TT (2006) Sortings for reactive systems. In: Baier C Hermanns H (eds) Proceedings of the 17th International Conference on Concurrency Theory. Lecture Notes in Computer Science vol 4137. Springer Berlin pp 248\u2013262","DOI":"10.1007\/11817949_17"},{"key":"e_1_2_1_2_5_2","unstructured":"Damgaard TC (2006) Syntactic theory for bigraphs. Master\u2019s thesis IT University of Copenhagen"},{"issue":"1","key":"e_1_2_1_2_6_2","first-page":"58","article-title":"Axiomatizing binding bigraphs","volume":"13","author":"Damgaard TC","year":"2006","journal-title":"Nordic J Comput"},{"key":"e_1_2_1_2_7_2","unstructured":"Ehrig H Ehrig K Prange U Taentzer G (2006) Fundamentals of algebraic graph transformation. Monographs in theoretical computer science. An EATCS series. Springer Berlin"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0818"},{"key":"e_1_2_1_2_9_2","unstructured":"Glenstrup AJ Damgaard TC H\u00f8jsgaard E Birkedal L (2010) An implementation of bigraph matching. Technical report TR-2010-135 IT University of Copenhagen"},{"key":"e_1_2_1_2_10_2","unstructured":"Jensen OH (2006) Mobile processes in bigraphs monograph Available at. http:\/\/www.cl.cam.ac.uk\/~rm135\/Jensen-monograph.html"},{"key":"e_1_2_1_2_11_2","unstructured":"Jensen OH Milner R (2004) Bigraphs and mobile processes (revised). Technical report UCAM-CL-TR-580 University of Cambridge"},{"key":"e_1_2_1_2_12_2","unstructured":"Leifer JJ Milner R (2004) Transition systems link graphs and Petri nets. Technical Report UCAM-CL-TR-598 University of Cambridge"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129501003577"},{"key":"e_1_2_1_2_14_2","unstructured":"Milner R (2004) Bigraphs whose names have multiple locality. Technical report UCAM-CL-TR-603 University of Cambridge"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129505004809"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.07.003"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/1540607"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90064-3"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1044"},{"key":"e_1_2_1_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/581804"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"crossref","unstructured":"Varr\u00f3 G Varr\u00f3 D Friedl K (2005) Adaptive graph pattern matching for model transformations using model-sensitive search plans. In: Karsai G Taentzer G (eds) GraMot 2005 International workshop on graph and model transformations. Electronic notes in theoretical computer science pps 191\u2013205","DOI":"10.1016\/j.entcs.2005.10.025"},{"key":"e_1_2_1_2_23_2","doi-asserted-by":"crossref","unstructured":"Z\u00fcndorf A (1994) Graph pattern matching in PROGRES. In: Cuny JE Ehrig H Engels G Rozenberg G (eds) TAGT Lecture Notes in Computer Science vol 1073. Springer Berlin pp 454\u2013468","DOI":"10.1007\/3-540-61228-9_105"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-011-0184-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-011-0184-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-011-0184-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:53:59Z","timestamp":1641484439000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-011-0184-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1007\/s00165-011-0184-5"],"URL":"https:\/\/doi.org\/10.1007\/s00165-011-0184-5","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}