{"id":"https://openalex.org/W2084135842","doi":"https://doi.org/10.1007/s00165-011-0184-5","title":"An inductive characterization of matching in binding bigraphs","display_name":"An inductive characterization of matching in binding bigraphs","publication_year":2011,"publication_date":"2011-07-14","ids":{"openalex":"https://openalex.org/W2084135842","doi":"https://doi.org/10.1007/s00165-011-0184-5","mag":"2084135842"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-011-0184-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-011-0184-5","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0184-5","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0184-5","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010565963","display_name":"Troels C. Damgaard","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Troels C. Damgaard","raw_affiliation_strings":["IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074407103","display_name":"Arne John Glenstrup","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Arne J. Glenstrup","raw_affiliation_strings":["IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114258078","display_name":"Robin Milner","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robin Milner","raw_affiliation_strings":["The Computer Laboratory, University of Cambridge, CB3 0FD, Cambridge, UK","The Computer Laboratory, University of Cambridge, Cambridge, UK CB3 0FD#TAB#"],"affiliations":[{"raw_affiliation_string":"The Computer Laboratory, University of Cambridge, CB3 0FD, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"The Computer Laboratory, University of Cambridge, Cambridge, UK CB3 0FD#TAB#","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5010565963"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":1.2854,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.80473546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"25","issue":"2","first_page":"257","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7881599068641663},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.778255820274353},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.6930791139602661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6436401605606079},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4754607081413269},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41225677728652954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2615504264831543},{"id":"https://openalex.org/keywords/nanotechnology","display_name":"Nanotechnology","score":0.049169719219207764}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7881599068641663},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.778255820274353},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.6930791139602661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6436401605606079},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4754607081413269},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41225677728652954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2615504264831543},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.049169719219207764},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-011-0184-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-011-0184-5","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0184-5","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/ba9d0475-e6a4-43e1-8d98-37d59e681664","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/ba9d0475-e6a4-43e1-8d98-37d59e681664","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damgaard , T C , Glenstrup , A J , Birkedal , L & Milner , R 2010 , ' An Inductive Characterization of Matching in Binding Bigraphs ' , Formal Aspects of Computing .","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00165-011-0184-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-011-0184-5","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0184-5","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2084135842.pdf","grobid_xml":"https://content.openalex.org/works/W2084135842.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W167874995","https://openalex.org/W204235972","https://openalex.org/W1506257272","https://openalex.org/W1524658540","https://openalex.org/W1546805905","https://openalex.org/W1548957673","https://openalex.org/W1559144499","https://openalex.org/W1588422495","https://openalex.org/W1638945901","https://openalex.org/W1965682336","https://openalex.org/W1969001723","https://openalex.org/W1976396930","https://openalex.org/W2048001624","https://openalex.org/W2089663991","https://openalex.org/W2120076632","https://openalex.org/W2126359798","https://openalex.org/W2128695242","https://openalex.org/W2138984561","https://openalex.org/W2161806321","https://openalex.org/W2167058518","https://openalex.org/W2510163061","https://openalex.org/W4285719527","https://openalex.org/W6606887161"],"related_works":["https://openalex.org/W3107994849","https://openalex.org/W2051487156","https://openalex.org/W4247143848","https://openalex.org/W2073681303","https://openalex.org/W2735573198","https://openalex.org/W2009883749","https://openalex.org/W29442446","https://openalex.org/W2896904446","https://openalex.org/W330727063","https://openalex.org/W1483407203"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"analyze":[2],"the":[3],"matching":[4,19,33],"problem":[5],"for":[6,29],"bigraphs.":[7],"In":[8],"particular,":[9],"we":[10],"present":[11],"a":[12,27,30],"sound":[13],"and":[14],"complete":[15],"inductive":[16],"characterization":[17],"of":[18],"in":[20],"bigraphs":[21],"with":[22],"binding.":[23],"Our":[24],"results":[25],"yield":[26],"specification":[28],"provably":[31],"correct":[32],"algorithm,":[34],"as":[35],"needed":[36],"by":[37],"our":[38],"prototype":[39],"tool":[40],"implementing":[41],"bigraphical":[42],"reactive":[43],"systems.":[44]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}