{"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":1771045967260,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030513719","type":"print"},{"value":"9783030513726","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-51372-6_3","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"38-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing Embeddings of Directed Bigraphs"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Chiapperini","sequence":"first","affiliation":[]},{"given":"Marino","family":"Miculan","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Peressotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-03741-2_28","volume-title":"Algebra and Coalgebra in Computer Science","author":"G Bacci","year":"2009","unstructured":"Bacci, G., Grohmann, D., Miculan, M.: DBtk: a toolkit for directed bigraphs. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 413\u2013422. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_28"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bacci, G., Grohmann, D., Miculan, M.: A framework for protein and membrane interactions. arXiv preprint arXiv:0911.4513 (2009)","DOI":"10.4204\/EPTCS.11.2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-662-45917-1_2","volume-title":"Trustworthy Global Computing","author":"G Bacci","year":"2014","unstructured":"Bacci, G., Miculan, M., Rizzi, R.: Finding a forest in a tree. In: Maffei, M., Tuosto, E. (eds.) TGC 2014. LNCS, vol. 8902, pp. 17\u201333. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45917-1_2"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-68265-3_6","volume-title":"Coordination Models and Languages","author":"M Bundgaard","year":"2008","unstructured":"Bundgaard, M., Glenstrup, A.J., Hildebrandt, T., H\u00f8jsgaard, E., Niss, H.: Formalizing higher-order mobile embedded business processes with binding bigraphs. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 83\u201399. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68265-3_6"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Burco, F., Miculan, M., Peressotti, M.: Towards a formal model for composable container systems. In: Proceedings of the SAC, pp. 173\u2013175. ACM (2020)","DOI":"10.1145\/3341105.3374121"},{"key":"3_CR6","unstructured":"Chiapperini, A., Miculan, M., Peressotti, M.: A CSP implementation of the directed bigraph embedding problem. CoRR abs\/2003.10209 (2020)"},{"issue":"2","key":"3_CR7","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. Form. Asp. Comp. 25(2), 257\u2013288 (2013)","journal-title":"Form. Asp. Comp."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.entcs.2012.05.015","volume":"284","author":"TC Damgaard","year":"2012","unstructured":"Damgaard, T.C., H\u00f8jsgaard, E., Krivine, J.: Formal cellular machinery. Electr. Not. Theoret. Comput. Sci. 284, 55\u201374 (2012)","journal-title":"Electr. Not. Theoret. Comput. Sci."},{"key":"3_CR9","first-page":"1","volume":"61","author":"AJ Faithfull","year":"2013","unstructured":"Faithfull, A.J., Perrone, G., Hildebrandt, T.T.: Big red: a development environment for bigraphs. Electr. Commun. EASST 61, 1\u201310 (2013)","journal-title":"Electr. Commun. EASST"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2018.07.006","volume":"253","author":"A Gassara","year":"2019","unstructured":"Gassara, A., Rodriguez, I.B., Jmaiel, M., Drira, K.: Executing bigraphical reactive systems. Discr. Appl. Math. 253, 73\u201392 (2019)","journal-title":"Discr. Appl. Math."},{"key":"3_CR11","unstructured":"Glenstrup, A.J., Damgaard, T.C., Birkedal, L., H\u00f8jsgaard, E.: An implementation of bigraph matching. IT University of Copenhagen p. 22 (2007)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-87405-8_41","volume-title":"Graph Transformations","author":"D Grohmann","year":"2008","unstructured":"Grohmann, D.: Security, cryptography and directed bigraphs. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 487\u2013489. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87405-8_41"},{"key":"3_CR13","first-page":"121","volume":"173","author":"D Grohmann","year":"2007","unstructured":"Grohmann, D., Miculan, M.: Directed bigraphs. ENTCS 173, 121\u2013137 (2007)","journal-title":"ENTCS"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-74407-8_26","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"D Grohmann","year":"2007","unstructured":"Grohmann, D., Miculan, M.: Reactive systems over directed bigraphs. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 380\u2013394. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74407-8_26"},{"key":"3_CR15","first-page":"1","volume":"10","author":"D Grohmann","year":"2008","unstructured":"Grohmann, D., Miculan, M.: Controlling resource access in directed bigraphs. ECEASST 10, 1\u201321 (2008)","journal-title":"ECEASST"},{"key":"3_CR16","unstructured":"H\u00f8jsgaard, E., et al.: Bigraphical languages and their simulation. IT University of Copenhagen, Programming, Logic, and Semantics (2012)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and transitions. In: ACM SIGPLAN Notices, vol. 38, pp. 38\u201349. ACM (2003)","DOI":"10.1145\/640128.604135"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2008.10.006","volume":"218","author":"J Krivine","year":"2008","unstructured":"Krivine, J., Milner, R., Troina, A.: Stochastic bigraphs. Electr. Not. Theor. Comput. Sci. 218, 73\u201396 (2008)","journal-title":"Electr. Not. Theor. Comput. Sci."},{"key":"3_CR19","first-page":"1","volume":"71","author":"A Mansutti","year":"2014","unstructured":"Mansutti, A., Miculan, M., Peressotti, M.: Distributed execution of bigraphical reactive systems. ECEASST 71, 1\u201321 (2014)","journal-title":"ECEASST"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-662-43352-2_16","volume-title":"Distributed Applications and Interoperable Systems","author":"A Mansutti","year":"2014","unstructured":"Mansutti, A., Miculan, M., Peressotti, M.: Multi-agent systems design and prototyping with bigraphical reactive systems. In: Magoutis, K., Pietzuch, P. (eds.) DAIS 2014. LNCS, vol. 8460, pp. 201\u2013208. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43352-2_16"},{"key":"3_CR21","unstructured":"Mansutti, A., Miculan, M., Peressotti, M.: Towards distributed bigraphical reactive systems. In: Echahed, R., Habel, A., Mosbah, M. (eds.) Proceedings of the GCM 2014, p. 45 (2014). workshop version"},{"key":"3_CR22","unstructured":"Miculan, M., Peressotti, M.: Bigraphs reloaded: a presheaf presentation. Technical report UDMI\/01\/2013, Dept. of Mathematics and Computer Science, Univ. of Udine (2013). http:\/\/www.dimi.uniud.it\/miculan\/Papers\/UDMI012013.pdf"},{"key":"3_CR23","unstructured":"Miculan, M., Peressotti, M.: A CSP implementation of the bigraph embedding problem. CoRR abs\/1412.1042 (2014)"},{"key":"3_CR24","unstructured":"Miculan, M., Peressotti, M.: jLibBig: a library for bigraphical reactive systems, November 2015. https:\/\/github.com\/bigraphs\/jlibbig"},{"key":"3_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626661","volume-title":"The Space and Motion of Communicating Agents","author":"R Milner","year":"2009","unstructured":"Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge (2009)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Perrone, G., Debois, S., Hildebrandt, T.T.: Bigraphical refinement. In: Refine@FM. EPTCS, vol. 55, pp. 20\u201336 (2011)","DOI":"10.4204\/EPTCS.55.2"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Perrone, G., Debois, S., Hildebrandt, T.T.: A model checker for bigraphs. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, pp. 1320\u20131325 (2012)","DOI":"10.1145\/2245276.2231985"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Sahli, H., Ledoux, T., Rutten, \u00c9.: Modeling self-adaptive fog systems using bigraphs. In: Proceedings of the FOCLASA, Oslo, Norway, pp. 1\u201316, September 2019","DOI":"10.1007\/978-3-030-57506-9_19"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2015.02.011","volume":"577","author":"M Sevegnani","year":"2015","unstructured":"Sevegnani, M., Calder, M.: Bigraphs with sharing. Theoretical Computer Science 577, 43\u201373 (2015)","journal-title":"Theoretical Computer Science"},{"key":"3_CR30","unstructured":"Sevegnani, M., Unsworth, C., Calder, M.: A SAT based algorithm for the matching problem in bigraphs with sharing. University of Glasgow, Technical report (2010)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51372-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:54:37Z","timestamp":1710233677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/av5.ljnet.it\/icgt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 tool presentations were also accepted and included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}