{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T09:37:19Z","timestamp":1769420239477,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE12-0034"],"award-info":[{"award-number":["ANR-16-CE12-0034"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003990","name":"Conseil R\u00e9gional, \u00cele-de-France","doi-asserted-by":"publisher","award":["DIM-RFSI\/FORMAREBIO"],"award-info":[{"award-number":["DIM-RFSI\/FORMAREBIO"]}],"id":[{"id":"10.13039\/501100003990","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11047-019-09748-4","type":"journal-article","created":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:02:42Z","timestamp":1559980962000},"page":"91-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Concurrency in Boolean networks"],"prefix":"10.1007","volume":"19","author":[{"given":"Thomas","family":"Chatain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Haar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juri","family":"Kol\u010d\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7219-2027","authenticated-orcid":false,"given":"Lo\u00efc","family":"Paulev\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aalok","family":"Thakkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"issue":"5","key":"9748_CR1","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1007\/s11538-008-9304-7","volume":"70","author":"J Aracena","year":"2008","unstructured":"Aracena J (2008) Maximum number of fixed points in regulatory boolean networks. Bull Math Biol 70(5):1398\u20131409. https:\/\/doi.org\/10.1007\/s11538-008-9304-7","journal-title":"Bull Math Biol"},{"key":"9748_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TNN.2003.821555","volume":"15","author":"J Aracena","year":"2004","unstructured":"Aracena J, Demongeot J, Goles E (2004) Positive and negative circuits in discrete neural networks. IEEE Trans Neural Netw 15:77\u201383. https:\/\/doi.org\/10.1109\/TNN.2003.821555","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"9748_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.biosystems.2009.03.006","volume":"97","author":"J Aracena","year":"2009","unstructured":"Aracena J, Goles E, Moreira A, Salinas L (2009) On the robustness of update schedules in Boolean networks. Biosystems 97(1):1\u20138. https:\/\/doi.org\/10.1016\/j.biosystems.2009.03.006","journal-title":"Biosystems"},{"issue":"3","key":"9748_CR4","doi-asserted-by":"publisher","first-page":"1702","DOI":"10.1137\/16M1060868","volume":"31","author":"J Aracena","year":"2017","unstructured":"Aracena J, Richard A, Salinas L (2017) Number of fixed points and disjoint cycles in monotone boolean networks. SIAM J Discrete Math 31(3):1702\u20131725. https:\/\/doi.org\/10.1137\/16M1060868","journal-title":"SIAM J Discrete Math"},{"issue":"4","key":"9748_CR5","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.chaos.2012.01.002","volume":"45","author":"J Baetens","year":"2012","unstructured":"Baetens J, der Wee\u00ebn PV, Baets BD (2012) Effect of asynchronous updating on the stability of cellular automata. Chaos Solitons Fractals 45(4):383\u2013394. https:\/\/doi.org\/10.1016\/j.chaos.2012.01.002","journal-title":"Chaos Solitons Fractals"},{"issue":"3","key":"9748_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s10703-012-0146-4","volume":"40","author":"S Balaguer","year":"2012","unstructured":"Balaguer S, Chatain T, Haar S (2012) A concurrency-preserving translation from time Petri nets to networks of timed automata. Form Methods Syst Des 40(3):330\u2013355. https:\/\/doi.org\/10.1007\/s10703-012-0146-4","journal-title":"Form Methods Syst Des"},{"key":"9748_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.04.046","volume":"449","author":"P Baldan","year":"2012","unstructured":"Baldan P, Bruni A, Corradini A, K\u00f6nig B, Rodr\u00edguez C, Schwoon S (2012) Efficient unfolding of contextual Petri nets. TCS 449:2\u201322. https:\/\/doi.org\/10.1016\/j.tcs.2012.04.046","journal-title":"TCS"},{"issue":"1","key":"9748_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P Baldan","year":"2001","unstructured":"Baldan P, Corradini A, Montanari U (2001) Contextual Petri nets, asymmetric event structures, and processes. Inf Comput 171(1):1\u201349. https:\/\/doi.org\/10.1006\/inco.2001.3060","journal-title":"Inf Comput"},{"key":"9748_CR9","doi-asserted-by":"publisher","unstructured":"Busi N, Pinna GM (1996) Non sequential semantics for contextual P\/T nets. In: Application and theory of Petri nets, lecture notes in computer science, vol 1091, pp 113\u2013132. Springer. https:\/\/doi.org\/10.1007\/3-540-61363-3_7","DOI":"10.1007\/3-540-61363-3_7"},{"issue":"4","key":"9748_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1093\/bib\/bbm029","volume":"8","author":"C Chaouiya","year":"2007","unstructured":"Chaouiya C (2007) Petri net modelling of biological networks. Brief Bioinf 8(4):210\u2013219. https:\/\/doi.org\/10.1093\/bib\/bbm029","journal-title":"Brief Bioinf"},{"issue":"2","key":"9748_CR11","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s11047-010-9178-0","volume":"10","author":"C Chaouiya","year":"2011","unstructured":"Chaouiya C, Naldi A, Remy E, Thieffry D (2011) Petri net representation of multi-valued logical regulatory graphs. Nat Comput 10(2):727\u2013750. https:\/\/doi.org\/10.1007\/s11047-010-9178-0","journal-title":"Nat Comput"},{"key":"9748_CR12","doi-asserted-by":"publisher","unstructured":"Chaouiya C, Remy E, Ruet P, Thieffry D (2004) Qualitative modelling of genetic networks: From logical regulatory graphs to standard Petri nets. In: Cortadella J,\u00a0Reisig W (eds) Applications and theory of Petri nets 2004, 25th international conference, ICATPN 2004, Bologna, Italy, June 21\u201325, 2004, Proceedings, lecture notes in computer science, vol 3099, pp 137\u2013156. Springer. https:\/\/doi.org\/10.1007\/978-3-540-27793-4_9","DOI":"10.1007\/978-3-540-27793-4_9"},{"key":"9748_CR13","doi-asserted-by":"publisher","unstructured":"Chatain T, Haar S, Jezequel L, Paulev\u00e9 L, Schwoon S (2014) Characterization of reachable attractors using Petri net unfoldings. In: Computational methods in systems biology, lecture notes in computer science, vol 8859. Springer, pp 129\u2013142. https:\/\/doi.org\/10.1007\/978-3-319-12982-2_10","DOI":"10.1007\/978-3-319-12982-2_10"},{"key":"9748_CR14","doi-asserted-by":"publisher","unstructured":"Chatain T, Haar S, Koutny M, Schwoon S (2015) Non-atomic transition firing in contextual nets. In: Applications and Theory of Petri Nets, Lecture Notes in Computer Science, vol 9115, pp 117\u2013136. Springer. https:\/\/doi.org\/10.1007\/978-3-319-19488-2_6","DOI":"10.1007\/978-3-319-19488-2_6"},{"key":"9748_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-92675-9_3","volume-title":"Cellular automata and discrete complex systems (AUTOMATA 2018)","author":"T Chatain","year":"2018","unstructured":"Chatain T, Haar S, Paulev\u00e9 L (2018) Boolean networks: beyond generalized asynchronicity. In: Baetens JM, Kutrib M (eds) Cellular automata and discrete complex systems (AUTOMATA 2018), vol 10875. Lecture Notes in Computer Science. Springer, Ghent, pp 29\u201342. https:\/\/doi.org\/10.1007\/978-3-319-92675-9_3"},{"key":"9748_CR16","doi-asserted-by":"publisher","unstructured":"Chatain T, Paulev\u00e9 L (2017) Goal-Driven Unfolding of Petri Nets. In: R.\u00a0Meyer, U.\u00a0Nestmann (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol\u00a085, pp 18:1\u201318:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.18","DOI":"10.4230\/LIPIcs.CONCUR.2017.18"},{"issue":"1&2","key":"9748_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng A, Esparza J, Palsberg J (1995) Complexity results for 1-safe nets. Theor Comput Sci 147(1&2):117\u2013136. https:\/\/doi.org\/10.1016\/0304-3975(94)00231-7","journal-title":"Theor Comput Sci"},{"issue":"23","key":"9748_CR18","doi-asserted-by":"publisher","first-page":"5792","DOI":"10.1073\/pnas.1610622114","volume":"114","author":"S Collombet","year":"2017","unstructured":"Collombet S, van Oevelen C, Sardina Ortega JL, Abou-Jaoud\u00e9 W, Di Stefano B, Thomas-Chollier M, Graf T, Thieffry D (2017) Logical modeling of lymphoid and myeloid cell specification and transdifferentiation. Proc Natl Acad Sci 114(23):5792\u20135799. https:\/\/doi.org\/10.1073\/pnas.1610622114","journal-title":"Proc Natl Acad Sci"},{"key":"9748_CR19","doi-asserted-by":"publisher","unstructured":"Courtiat J, Sa\u00efdouni D (1995) Relating maximality-based semantics to action refinement in process algebras. In: Formal description techniques VII, proceedings of the 7th IFIP WG6.1 international conference on formal description techniques, Berne, Switzerland, 1994, IFIP conference proceedings, vol\u00a06, pp 293\u2013308. Chapman & Hall. https:\/\/doi.org\/10.1007\/978-0-387-34878-0_24","DOI":"10.1007\/978-0-387-34878-0_24"},{"key":"9748_CR20","volume-title":"Unfoldings\u2013a partial-order approach to model checking","author":"J Esparza","year":"2008","unstructured":"Esparza J, Heljanko K (2008) Unfoldings\u2013a partial-order approach to model checking. Springer, Berlin"},{"issue":"17","key":"9748_CR21","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1093\/bioinformatics\/btn336","volume":"24","author":"A Garg","year":"2008","unstructured":"Garg A, Di Cara A, Xenarios I, Mendoza L, De Micheli G (2008) Synchronous versus asynchronous modeling of gene regulatory networks. Bioinformatics 24(17):1917\u20131925. https:\/\/doi.org\/10.1093\/bioinformatics\/btn336","journal-title":"Bioinformatics"},{"issue":"12","key":"9748_CR22","doi-asserted-by":"publisher","first-page":"6750","DOI":"10.1073\/pnas.95.12.6750","volume":"95","author":"PJE Goss","year":"1998","unstructured":"Goss PJE, Peccoud J (1998) Quantitative modeling of stochastic systems in molecular biology by using stochastic Petri nets. Proc Natl Acad Sci 95(12):6750\u20136755. https:\/\/doi.org\/10.1073\/pnas.95.12.6750","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"9748_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(93)90238-O","volume":"112","author":"R Janicki","year":"1993","unstructured":"Janicki R, Koutny M (1993) Structure of concurrency. Theor Comput Sci 112(1):5\u201352. https:\/\/doi.org\/10.1016\/0304-3975(93)90238-O","journal-title":"Theor Comput Sci"},{"key":"9748_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s002360050090","volume":"34","author":"R Janicki","year":"1997","unstructured":"Janicki R, Koutny M (1997) Fundamentals of modelling concurrency using discrete relational structures. Acta Inf 34:367\u2013388. https:\/\/doi.org\/10.1007\/s002360050090","journal-title":"Acta Inf"},{"key":"9748_CR25","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0304-3975(86)90177-5","volume":"43","author":"R Janicki","year":"1986","unstructured":"Janicki R, Lauer PE, Koutny M, Devillers RR (1986) Concurrent and maximally concurrent evolution of nonsequential systems. Theor Comput Sci 43:213\u2013238. https:\/\/doi.org\/10.1016\/0304-3975(86)90177-5","journal-title":"Theor Comput Sci"},{"key":"9748_CR26","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"SA Kauffman","year":"1969","unstructured":"Kauffman SA (1969) Metabolic stability and epigenesis in randomly connected nets. J Theor Biol 22:437\u2013467. https:\/\/doi.org\/10.1016\/0022-5193(69)90015-0","journal-title":"J Theor Biol"},{"key":"9748_CR27","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"J Kol\u010d\u00e1k","year":"2018","unstructured":"Kol\u010d\u00e1k J, \u0160afr\u00e1nek D, Haar S, Paulev\u00e9 L (2018) Parameter space abstraction and unfolding semantics of discrete regulatory networks. Theor Comput Sci. https:\/\/doi.org\/10.1016\/j.tcs.2018.03.009","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9748_CR28","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.jtbi.2009.04.024","volume":"259","author":"Z Mai","year":"2009","unstructured":"Mai Z, Liu H (2009) Boolean network-based analysis of the apoptosis network: irreversible apoptosis and stable surviving. J Theor Biol 259(4):760\u2013769. https:\/\/doi.org\/10.1016\/j.jtbi.2009.04.024","journal-title":"J Theor Biol"},{"issue":"2","key":"9748_CR29","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.biosystems.2013.05.007","volume":"113","author":"P Mart\u00ednez-Sosa","year":"2013","unstructured":"Mart\u00ednez-Sosa P, Mendoza L (2013) The regulatory network that controls the differentiation of t lymphocytes. Biosystems 113(2):96\u2013103. https:\/\/doi.org\/10.1016\/j.biosystems.2013.05.007","journal-title":"Biosystems"},{"key":"9748_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-016-9608-8","author":"M Noual","year":"2017","unstructured":"Noual M, Sen\u00e9 S (2017) Synchronism versus asynchronism in monotonic boolean automata networks. Nat Comput. https:\/\/doi.org\/10.1007\/s11047-016-9608-8","journal-title":"Nat Comput"},{"issue":"5","key":"9748_CR31","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1093\/bioinformatics\/btv628","volume":"32","author":"E Palma","year":"2016","unstructured":"Palma E, Salinas L, Aracena J (2016) Enumeration and extension of non-equivalent deterministic update schedules in boolean networks. Bioinformatics 32(5):722\u2013729. https:\/\/doi.org\/10.1093\/bioinformatics\/btv628","journal-title":"Bioinformatics"},{"key":"9748_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2017.2749225","author":"L Paulev\u00e9","year":"2017","unstructured":"Paulev\u00e9 L (2017) Reduction of qualitative models of biological networks for transient dynamics analysis. IEEE\/ACM Trans Comput Biol Bioinf. https:\/\/doi.org\/10.1109\/TCBB.2017.2749225","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"1","key":"9748_CR33","first-page":"149","volume":"67","author":"L Popova-Zeugmann","year":"2005","unstructured":"Popova-Zeugmann L, Heiner M, Koch I (2005) Time Petri nets for modelling and analysis of biochemical networks. Fundam Inf 67(1):149\u2013162","journal-title":"Fundam Inf"},{"issue":"3","key":"9748_CR34","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.aam.2007.11.003","volume":"41","author":"E Remy","year":"2008","unstructured":"Remy E, Ruet P, Thieffry D (2008) Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Adv Appl Math 41(3):335\u2013350. https:\/\/doi.org\/10.1016\/j.aam.2007.11.003","journal-title":"Adv Appl Math"},{"issue":"4","key":"9748_CR35","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.aam.2009.11.011","volume":"44","author":"A Richard","year":"2010","unstructured":"Richard A (2010) Negative circuits and sustained oscillations in asynchronous automata networks. Adv Appl Math 44(4):378\u2013392. https:\/\/doi.org\/10.1016\/j.aam.2009.11.011","journal-title":"Adv Appl Math"},{"key":"9748_CR36","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez C, Schwoon S (2013) Cunf: a tool for unfolding and verifying Petri nets with read arcs. In: International symposium on automated technology for verification and analysis, pp 492\u2013495. Springer. https:\/\/doi.org\/10.1007\/978-3-319-02444-8_42","DOI":"10.1007\/978-3-319-02444-8_42"},{"issue":"1","key":"9748_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12918-016-0285-0","volume":"10","author":"A Rougny","year":"2016","unstructured":"Rougny A, Froidevaux C, Calzone L, Paulev\u00e9 L (2016) Qualitative dynamics semantics for SBGN process description. BMC Syst Biol 10(1):1\u201324. https:\/\/doi.org\/10.1186\/s12918-016-0285-0","journal-title":"BMC Syst Biol"},{"key":"9748_CR38","unstructured":"Schwoon S (2014) Mole. http:\/\/www.lsv.ens-cachan.fr\/~schwoon\/tools\/mole\/. Accessed 6 June 2019"},{"issue":"3","key":"9748_CR39","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0303-2647(99)00025-8","volume":"51","author":"B Sch\u00f6nfisch","year":"1999","unstructured":"Sch\u00f6nfisch B, de Roos A (1999) Synchronous and asynchronous updating in cellular automata. Biosystems 51(3):123\u2013143. https:\/\/doi.org\/10.1016\/S0303-2647(99)00025-8","journal-title":"Biosystems"},{"issue":"3","key":"9748_CR40","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1093\/bioinformatics\/btl596","volume":"23","author":"LJ Steggles","year":"2007","unstructured":"Steggles LJ, Banks R, Shaw O, Wipat A (2007) Qualitatively modelling and analysing genetic regulatory networks: a Petri net approach. Bioinformatics 23(3):336\u2013343. https:\/\/doi.org\/10.1093\/bioinformatics\/btl596","journal-title":"Bioinformatics"},{"key":"9748_CR41","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF02460619","volume":"57","author":"D Thieffry","year":"1995","unstructured":"Thieffry D, Thomas R (1995) Dynamical behaviour of biological regulatory networks-II. Immunity control in bacteriophage lambda. Bull Math Biol 57:277\u2013297. https:\/\/doi.org\/10.1007\/BF02460619","journal-title":"Bull Math Biol"},{"issue":"3","key":"9748_CR42","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0022-5193(73)90247-6","volume":"42","author":"R Thomas","year":"1973","unstructured":"Thomas R (1973) Boolean formalization of genetic control circuits. J Theor Biol 42(3):563\u2013585. https:\/\/doi.org\/10.1016\/0022-5193(73)90247-6","journal-title":"J Theor Biol"},{"issue":"17","key":"9748_CR43","doi-asserted-by":"publisher","first-page":"i772","DOI":"10.1093\/bioinformatics\/btw457","volume":"32","author":"P Traynard","year":"2016","unstructured":"Traynard P, Faur\u00e9 A, Fages F, Thieffry D (2016) Logical model specification aided by model-checking techniques: application to the mammalian cell cycle regulation. Bioinformatics 32(17):i772\u2013i780. https:\/\/doi.org\/10.1093\/bioinformatics\/btw457","journal-title":"Bioinformatics"},{"issue":"1","key":"9748_CR44","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 (1995) Fairness and partial order semantics. Inf Process Lett 55(1):33\u201339. https:\/\/doi.org\/10.1016\/0020-0190(95)00049-I","journal-title":"Inf Process Lett"},{"issue":"1","key":"9748_CR45","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/s0304-3975(01)00234-1","volume":"286","author":"W Vogler","year":"2002","unstructured":"Vogler W (2002) Partial order semantics and read arcs. Theor Comput Sci 286(1):33\u201363. https:\/\/doi.org\/10.1016\/s0304-3975(01)00234-1","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9748_CR46","first-page":"71","volume":"36","author":"J Winkowski","year":"1998","unstructured":"Winkowski J (1998) Processes of contextual nets and their characteristics. Fundam Inf 36(1):71\u2013101","journal-title":"Fundam Inf"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09748-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-019-09748-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09748-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:15:31Z","timestamp":1740053731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-019-09748-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["9748"],"URL":"https:\/\/doi.org\/10.1007\/s11047-019-09748-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}