{"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":1771045967314,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"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_1","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Conditional Bigraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-6658","authenticated-orcid":false,"given":"Blair","family":"Archibald","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5033-7232","authenticated-orcid":false,"given":"Muffy","family":"Calder","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6773-9481","authenticated-orcid":false,"given":"Michele","family":"Sevegnani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"111513","DOI":"10.1109\/ACCESS.2019.2934221","volume":"7","author":"F Alrimawi","year":"2019","unstructured":"Alrimawi, F., Pasquale, L., Nuseibeh, B.: On the automated management of security incidents in smart spaces. IEEE Access 7, 111513\u2013111527 (2019)","journal-title":"IEEE Access"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1109\/JIOT.2020.2964026","volume":"7","author":"B Archibald","year":"2020","unstructured":"Archibald, B., Shieh, M., Hu, Y., Sevegnani, M., Lin, Y.: BigraphTalk: verified design of IoT applications. IEEE Internet Things J. 7(4), 2955\u20132967 (2020). https:\/\/doi.org\/10.1109\/JIOT.2020.2964026. ISSN 2372-2541","journal-title":"IEEE Internet Things J."},{"issue":"2&3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(89)90006-6","volume":"67","author":"JCM Baeten","year":"1989","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Weijland, W.P.: Term-rewriting systems with rule priorities. Theor. Comput. Sci. 67(2&3), 283\u2013301 (1989)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2882784","volume":"23","author":"S Benford","year":"2016","unstructured":"Benford, S., Calder, M., Rodden, T., Sevegnani, M.: On lions, impala, and bigraphs: modelling interactions in physical\/virtual spaces. ACM Trans. Comput. Hum. Interact. 23(2), 1\u201356 (2016)","journal-title":"ACM Trans. Comput. Hum. Interact."},{"key":"1_CR5","unstructured":"Bruggink, H.J.S., Cauderlier, R., H\u00fclsbusch, M., K\u00f6nig, B.: Conditional reactive systems. In: FSTTCS, pp. 191\u2013203 (2011)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.scico.2013.08.004","volume":"80","author":"M Calder","year":"2014","unstructured":"Calder, M., Koliousis, A., Sevegnani, M., Sventek, J.S.: Real-time verification of wireless home networks using bigraphs with sharing. Sci. Comput. Program. 80, 288\u2013310 (2014)","journal-title":"Sci. Comput. Program."},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Ciancia, V., Latella, D., Loreti, M., Massink, M.: Specifying and verifying properties of space. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 222\u2013235. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_18","DOI":"10.1007\/978-3-662-44602-7_18"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: Spatial logics for bigraphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 766\u2013778. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_62","DOI":"10.1007\/11523468_62"},{"key":"1_CR9","first-page":"72","volume":"78","author":"H Ehrig","year":"2002","unstructured":"Ehrig, H.: Bigraphs meet double pushouts. Bull. EATCS 78, 72\u201385 (2002)","journal-title":"Bull. EATCS"},{"key":"1_CR10","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"issue":"3\/4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundam. Inform. 26(3\/4), 287\u2013313 (1996)","journal-title":"Fundam. Inform."},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling, Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday. LNCS, vol. 3393, pp. 293\u2013308. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31847-7_17","DOI":"10.1007\/978-3-540-31847-7_17"},{"key":"1_CR13","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. Electron. Notes Theor. Comput. Sci. 218, 73\u201396 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR15","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":"1_CR16","doi-asserted-by":"publisher","unstructured":"Muffy, C., Michele, S.: Modelling IEEE 802.11 CSMA\/CA RTS\/CTS with stochastic bigraphs with sharing. Form. Asp. Comput. 26(3), 537\u2013561 (2014). https:\/\/doi.org\/10.1007\/s00165-012-0270-3. ISSN 0934-5043","DOI":"10.1007\/s00165-012-0270-3"},{"key":"1_CR17","unstructured":"Sevegnani, M.: Bigraphs with sharing and applications in wireless networks. Ph.D. thesis, School of Computing Science, University of Glasgow (2012)"},{"key":"1_CR18","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. Theor. Comput. Sci. 577, 43\u201373 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Sevegnani, M., Calder, M.: BigraphER: rewriting and analysis engine for bigraphs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 494\u2013501. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_27","DOI":"10.1007\/978-3-319-41540-6_27"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Sevegnani, M., Kab\u00e1c, M., Calder, M., McCann, J.A.: Modelling and verification of large-scale sensor network infrastructures. In: ICECCS, pp. 71\u201381 (2018)","DOI":"10.1109\/ICECCS2018.2018.00016"},{"key":"1_CR21","unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. Ph.D. thesis, Aarhus University (2004)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Tsigkanos, C., Kehrer, T., Ghezzi, C.: Modeling and verification of evolving cyber-physical spaces. In: ESEC\/FSE, pp. 38\u201348 (2017)","DOI":"10.1145\/3106237.3106299"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:54:22Z","timestamp":1710233662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_1","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"}]}}