{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:53:09Z","timestamp":1742982789457,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030603267"},{"type":"electronic","value":"9783030603274"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60327-4_17","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T22:38:31Z","timestamp":1601505511000},"page":"321-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Drawing the Line: Basin Boundaries in Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Haar","sequence":"first","affiliation":[]},{"given":"Lo\u00efc","family":"Paulev\u00e9","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schwoon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theor. Comput. Sci. 82(2), 253\u2013284 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-12982-2_10","volume-title":"Computational Methods in Systems Biology","author":"T Chatain","year":"2014","unstructured":"Chatain, T., Haar, S., Jezequel, L., Paulev\u00e9, L., Schwoon, S.: Characterization of reachable attractors using Petri Net Unfoldings. In: Mendes, P., Dada, J.O., Smallbone, K. (eds.) CMSB 2014. LNCS, vol. 8859, pp. 129\u2013142. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12982-2_10"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Chatain, T., Haar, S., Kolc\u00e1k, J., Paulev\u00e9, L., Thakkar, A.: Concurrency in Boolean networks. Natural Comput. (2019, to appear)","DOI":"10.1007\/s11047-019-09748-4"},{"key":"17_CR4","unstructured":"Thomas Chatain and Lo\u00efc Paulev\u00e9. Goal-driven unfolding of petri nets. In Roland Meyer and Uwe Nestmann, editors, 28th International Conference on Concurrency Theory, CONCUR 2017, 5\u20138 September 2017, Berlin, Germany, LIPIcs, vol. 85, pp. 18:1\u201318:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"11","key":"17_CR5","doi-asserted-by":"publisher","first-page":"e1004571","DOI":"10.1371\/journal.pcbi.1004571","volume":"11","author":"DPA Cohen","year":"2015","unstructured":"Cohen, D.P.A., Martignetti, L., Robine, S., Barillot, E., Zinovyev, A., Calzone, L.: Mathematical modelling of molecular pathways enabling tumour cell invasion and migration. PLoS Comput. Biol. 11(11), e1004571 (2015)","journal-title":"PLoS Comput. Biol."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-32304-2_18","volume-title":"Static Analysis","author":"C Deng","year":"2019","unstructured":"Deng, C., Cousot, P.: Responsibility analysis by abstract interpretation. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 368\u2013388. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_18"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)","DOI":"10.1142\/2563"},{"key":"17_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77426-6"},{"key":"17_CR9","first-page":"285","volume":"20","author":"J Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. FMSD 20, 285\u2013310 (2002)","journal-title":"FMSD"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1186\/s13015-017-0110-3","volume":"12","author":"LF Fitime","year":"2017","unstructured":"Fitime, L.F., Roux, O., Guziolowski, C., Paulev\u00e9, L.: Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming. Algorithm Molecular Biol. 12(1), 19 (2017)","journal-title":"Algorithm Molecular Biol."},{"key":"17_CR11","unstructured":"Fueyo, S., Monteiro, P.T., Naldi, A., Dorier, J., Remy, \u00c9, Chaouiya, C.: Reversed dynamics to uncover basins of attraction of asynchronous logical models. F1000Research 30(6) (2017)"},{"key":"17_CR12","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","year":"1996","unstructured":"Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60761-7"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45995-2_8","volume-title":"LATIN 2002: Theoretical Informatics","author":"\u00c9 Goubault","year":"2002","unstructured":"Goubault, \u00c9., Raussen, M.: Dihomotopy as a tool in state space analysis tutorial. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 16\u201337. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45995-2_8"},{"key":"17_CR14","unstructured":"Khomenk, V.: Punf. http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf\/"},{"key":"17_CR15","first-page":"115","volume":"17","author":"H Klarner","year":"2018","unstructured":"Klarner, H., Siebert, H., Nee, S., Heinitz, F.: Basins of attraction, commitment sets and phenotypes of Boolean networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 17, 115\u20131124 (2018)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-31304-3_1","volume-title":"Computational Methods in Systems Biology","author":"H Mandon","year":"2019","unstructured":"Mandon, H., Su, C., Haar, S., Pang, J., Paulev\u00e9, L.: Sequential reprogramming of Boolean networks made practical. In: Bortolussi, L., Sanguinetti, G. (eds.) CMSB 2019. LNCS, vol. 11773, pp. 3\u201319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31304-3_1"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Mandon, H., Su, C., Pang, J., Paul, S., Haar, S., Paulev\u00e9, L.: Algorithms for the sequential reprogramming of Boolean networks. IEEE\/ACM Trans. Computat. Biol. Bioinform. (2019, to appear)","DOI":"10.1109\/TCBB.2019.2914383"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: CAV, pp. 164\u2013177 (1992)","DOI":"10.1007\/3-540-56496-9_14"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Mendes, N.D., Henriques, R., Remy, E., Carneiro, J., Monteiro, P.T., Chaouiya, C.: Estimating attractor reachability in asynchronous logical models. Front. Physiol. 9 (2018)","DOI":"10.3389\/fphys.2018.01161"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, Part I. Theor. Comput. Sci. 13, 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR22","unstructured":"Schwoon, S.: Mole. http:\/\/www.lsv.ens-cachan.fr\/~schwoon\/tools\/mole\/"},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(95)00049-I","volume":"55","author":"W Vogler","year":"1995","unstructured":"Vogler, W.: Fairness and partial order semantics. Inf. Process. Lett. 55(1), 33\u201339 (1995)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Computational Methods in Systems Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60327-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T21:46:34Z","timestamp":1619300794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60327-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030603267","9783030603274"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60327-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Methods in Systems Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Konstanz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmsb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cmsb2020.uni-saarland.de\/","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":"30","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":"22","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":"73% - 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":"2","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":"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)"}}]}}