{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:48:46Z","timestamp":1784310526601,"version":"3.55.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/S035362\/1"],"award-info":[{"award-number":["EP\/S035362\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"S4: Science of Sensor Systems Software","award":["EP\/N007565\/1"],"award-info":[{"award-number":["EP\/N007565\/1"]}]},{"name":"Amazon Research Award on Automated Reasoning"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of rewrite rules. This article presents a practical, yet detailed guide to developing, executing, and reasoning about bigraph models, including recent extensions such as parameterised, instantaneous, prioritised and conditional rules, and probabilistic and stochastic rewriting.<\/jats:p>","DOI":"10.1145\/3721142","type":"journal-article","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T11:02:07Z","timestamp":1740740527000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Practical Modelling with Bigraphs"],"prefix":"10.1145","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-6658","authenticated-orcid":false,"given":"Blair","family":"Archibald","sequence":"first","affiliation":[{"name":"University of Glasgow","place":["Glasgow, United Kingdom of Great Britain and Northern Ireland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5033-7232","authenticated-orcid":false,"given":"Muffy","family":"Calder","sequence":"additional","affiliation":[{"name":"University of Glasgow","place":["Glasgow, United Kingdom of Great Britain and Northern Ireland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6773-9481","authenticated-orcid":false,"given":"Michele","family":"Sevegnani","sequence":"additional","affiliation":[{"name":"University of Glasgow","place":["Glasgow, United Kingdom of Great Britain and Northern Ireland"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2934221"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51372-6_1"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3545180"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2021.102760"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","unstructured":"Blair Archibald Michele Sevegnani and Muffy Calder. 2025. Practical Modelling with Bigraphs: Model Files. DOI:10.5281\/zenodo.7188769","DOI":"10.5281\/zenodo.7188769"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882784"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49059-0_14"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_13"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.08.004"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-012-0270-3"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21292-5_7"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51372-6_3"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025774"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_62"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_26"},{"key":"e_1_3_3_18_2","volume-title":"Bigraphs by Example","author":"Debois S\u00f8ren","year":"2005","unstructured":"S\u00f8ren Debois and Troels Christoffer Damgaard. 2005. Bigraphs by Example. Technical Report. IT University of Copenhagen. Retrieved from https:\/\/en.itu.dk\/research\/technical-reports\/technical-reports-archive\/2005\/tr-2005-61"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45541-8_1"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21145-9_15"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.14279\/tuj.eceasst.61.835"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.031"},{"key":"e_1_3_3_23_2","article-title":"Bigraph toolkit suite","author":"Grzelak Dominik","year":"2023","unstructured":"Dominik Grzelak. 2023. Bigraph toolkit suite. Technische Universit\u00e4t Dresden (2023). Retrieved from https:\/\/bigraphs.org","journal-title":"Technische Universit\u00e4t Dresden"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00552-5"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43916-3"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-021-00633-z"},{"key":"e_1_3_3_27_2","article-title":"The BPL Tool: A Tool for Experimenting with Bigraphical Reactive Systems","author":"H\u00f8jsgaard Espen","year":"2011","unstructured":"Espen H\u00f8jsgaard and Arne John Glenstrup. 2011. The BPL Tool: A Tool for Experimenting with Bigraphical Reactive Systems. IT University of Copenhagen Technical Report. Retrieved from https:\/\/en.itu.dk\/research\/technical-reports\/technical-reports-archive\/2011\/tr-2011-145","journal-title":"IT University of Copenhagen Technical Report."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.10.006"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_47"},{"key":"e_1_3_3_30_2","volume-title":"Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers","author":"Lamport Leslie","year":"2002","unstructured":"Leslie Lamport. 2002. Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley. Retrieved from http:\/\/research.microsoft.com\/users\/lamport\/tla\/book.html"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44618-4_19"},{"key":"e_1_3_3_32_2","unstructured":"Cecile Marcon Cyril Allignol Celia Picard Blair Archibald Michele Sevegnani and Xavier Thirioux. 2025. Modelling bigraphs with Coq. In ACM\/SIGAPP Symposium On Applied Computing (Software Verification and Testing Track) Catania Sicily Italy April 2025."},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.002"},{"key":"e_1_3_3_34_2","unstructured":"Robin Milner. 2008. Lecture Notes on Bigraphs: A Model for Mobile Agents. Retrieved March 7 2025 from https:\/\/www.cl.cam.ac.uk\/archive\/rm135\/Bigraphs-Notes.pdf"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626661"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2006.322172"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2231985"},{"key":"e_1_3_3_39_2","volume-title":"Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence","author":"Plump Detlef","year":"1993","unstructured":"Detlef Plump. 1993. Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence. Wiley-Blackwell, United States."},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.02.011"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_27"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCS2018.2018.00016"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2016.2599880"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33024-7_17"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-64285-2_2"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:22:09Z","timestamp":1751368929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3721142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3721142"],"URL":"https:\/\/doi.org\/10.1145\/3721142","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"2024-05-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}