{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T16:26:24Z","timestamp":1750436784963,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038440"},{"type":"electronic","value":"9783642038457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03845-7_11","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T06:41:17Z","timestamp":1251268877000},"page":"158-172","source":"Crossref","is-referenced-by-count":12,"title":["The \u03ba-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cinzia","family":"Di Giusto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Gabbrielli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cosimo","family":"Laneve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1126\/science.1962191","volume":"254","author":"G. Whitesides","year":"1991","unstructured":"Whitesides, G., Mathias, J., Seto, C.: Molecular self-assembly and nanochemistry \u2013 a chemical strategy for the synthesis of nanostructures. Science\u00a0254, 1312\u20131319 (1991)","journal-title":"Science"},{"issue":"6","key":"11_CR2","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.1073\/pnas.91.6.2021","volume":"91","author":"I. Panyutin","year":"1994","unstructured":"Panyutin, I., Hsieh, P.: The kinetics of spontaneous DNA branch migration. Proc. National Academy of Science USA\u00a091(6), 2021\u20132025 (1994)","journal-title":"Proc. National Academy of Science USA"},{"issue":"6621","key":"11_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/386137b0","volume":"386","author":"C. Mao","year":"1997","unstructured":"Mao, C., Sun, W., Seeman, N.: Assembly of Borromean rings from DNA. Nature\u00a0386(6621), 137\u2013138 (1997)","journal-title":"Nature"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1038\/171737a0","volume":"171","author":"J. Watson","year":"1953","unstructured":"Watson, J., Crick, F.: A Structure for Deoxyribose Nucleic Acid. Nature\u00a0171, 737\u2013738 (1953)","journal-title":"Nature"},{"key":"11_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-75140-3_12","volume-title":"Computational Methods in Systems Biology","author":"A. Credi","year":"2007","unstructured":"Credi, A., Garavelli, M., Laneve, C., Pradalier, S., Silvi, S., Zavattaro, G.: Modelizations and simulations of nano devices in nanok calculus. In: Calder, M., Gilmore, S. (eds.) CMSB 2007. LNCS (LNBI), vol.\u00a04695, pp. 168\u2013183. Springer, Heidelberg (2007)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1038\/nature06451","volume":"451","author":"P. Yin","year":"2008","unstructured":"Yin, P., Harry, M., Choi, M., Colby, R., Calvert, R., Pierce, N.: Programming biomolecular self-assembly pathways. Nature\u00a0451, 318\u2013322 (2008)","journal-title":"Nature"},{"key":"11_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-48540-7_2","volume-title":"Systems Biology and Regulatory Genomics","author":"D.L. Dill","year":"2007","unstructured":"Dill, D.L., Knapp, M., Gage, P., Talcott, C.L., Laderoute, K., Lincoln, P.: The pathalyzer: A tool for analysis of signal transduction pathways. In: Eskin, E., Ideker, T., Raphael, B., Workman, C. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a04023, pp. 11\u201322. Springer, Heidelberg (2007)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-24599-5_7","volume-title":"Logic Programming","author":"F. Fages","year":"2003","unstructured":"Fages, F.: Symbolic model-checking for biochemical systems. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 102\u2013102. Springer, Heidelberg (2003)"},{"issue":"6","key":"11_CR9","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1093\/bioinformatics\/18.6.825","volume":"18","author":"M. Peleg","year":"2002","unstructured":"Peleg, M., Yeh, I., Altman, R.B.: Modelling biological processes using workflow and petri net models. Bioinformatics\u00a018(6), 825\u2013837 (2002)","journal-title":"Bioinformatics"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-78163-9_11","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"V. Danos","year":"2008","unstructured":"Danos, V., Feret, J., Fontana, W., Krivine, J.: Abstract interpretation of cellular signalling networks. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 83\u201397. Springer, Heidelberg (2008)"},{"key":"11_CR11","volume-title":"Computation: finite and infinite machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2004.03.065","volume":"325","author":"V. Danos","year":"2004","unstructured":"Danos, V., Laneve, C.: Formal molecular biology. TCS\u00a0325(1), 69\u2013110 (2004)","journal-title":"TCS"},{"key":"11_CR13","first-page":"245","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability Issues for Petri Nets-a Survey. Bulletin of the European Association for TCS\u00a052, 245\u2013262 (1994)","journal-title":"Bulletin of the European Association for TCS"},{"key":"11_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri nets: an introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri nets: an introduction. Springer, Heidelberg (1985)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-68894-5_3","volume-title":"Formal Methods for Computational Systems Biology","author":"F. Fages","year":"2008","unstructured":"Fages, F., Soliman, S.: Formal cell biology in biocham. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol.\u00a05016, pp. 54\u201380. Springer, Heidelberg (2008)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.4024\/2040402.jbpc.04.02","volume":"4","author":"F. Fages","year":"2004","unstructured":"Fages, F., Sollman, S., Chabrier-Rivier, N.: Modelling and querying interaction networks in the biochemical abstract machine biocham. Journal of Biological Physics and Chemistry\u00a04, 64\u201373 (2004)","journal-title":"Journal of Biological Physics and Chemistry"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Eker, S., Knapp, M., Laderoute, K., Lincoln, P., Meseguer, J., S\u00f6nmez, M.K.: Pathway logic: Symbolic analysis of biological signaling. In: Pacific Symposium on Biocomputing, pp. 400\u2013412 (2002)","DOI":"10.1142\/9789812799623_0038"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-68894-5_2","volume-title":"Formal Methods for Computational Systems Biology","author":"C.L. Talcott","year":"2008","unstructured":"Talcott, C.L.: Pathway logic. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol.\u00a05016, pp. 21\u201353. Springer, Heidelberg (2008)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-68894-5_7","volume-title":"Formal Methods for Computational Systems Biology","author":"M. Heiner","year":"2008","unstructured":"Heiner, M., Gilbert, D., Donaldson, R.: Petri nets for systems and synthetic biology. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol.\u00a05016, pp. 215\u2013264. Springer, Heidelberg (2008)"},{"key":"11_CR20","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11905455_5","volume-title":"Transactions on Computational Systems Biology VII","author":"M.L. Blinov","year":"2006","unstructured":"Blinov, M.L., Yang, J., Faeder, J.R., Hlavacek, W.S.: Graph theory for rule-based modeling of biochemical networks. In: Priami, C., Ing\u00f3lfsd\u00f3ttir, A., Mishra, B., Riis Nielson, H. (eds.) Transactions on Computational Systems Biology VII. LNCS (LNBI), vol.\u00a04230, pp. 89\u2013106. Springer, Heidelberg (2006)"},{"key":"11_CR21","unstructured":"Mayr, R., Rusinowitch, M.: Reachability is decidable for ground ac rewrite systems. In: Infinity 1998, pp. 53\u201364 (1998)"},{"issue":"1-2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput.\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-53904-2_104","volume-title":"Rewriting Techniques and Applications","author":"J.L. Coquid\u00e9","year":"1991","unstructured":"Coquid\u00e9, J.L., Dauchet, M., Gilleron, R., V\u00e1gv\u00f6lgyi, S.: Bottom-up tree pushdown automata and rewrite systems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 287\u2013298. Springer, Heidelberg (1991)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: LICS, pp. 242\u2013248 (1990)","DOI":"10.1109\/LICS.1990.113750"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. Syst. Sci.\u00a037(3), 367\u2013394 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11560586_12","volume-title":"Theoretical Computer Science","author":"N. Busi","year":"2005","unstructured":"Busi, N., Zavattaro, G.: Reachability analysis in boxed ambients. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 143\u2013159. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2004.10.020","volume":"333","author":"I. Boneva","year":"2005","unstructured":"Boneva, I., Talbot, J.M.: When ambients cannot be opened. Theor. Comput. Sci.\u00a0333(1-2), 127\u2013169 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-31987-0_18","volume-title":"Programming Languages and Systems","author":"N. Busi","year":"2005","unstructured":"Busi, N., Zavattaro, G.: Deciding reachability in mobile ambients. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 248\u2013262. Springer, Heidelberg (2005)"},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.entcs.2007.05.008","volume":"171","author":"G. Delzanno","year":"2007","unstructured":"Delzanno, G., Montagna, R.: On reachability and spatial reachability in fragments of bioambients. Electr. Notes Theor. Comput. Sci.\u00a0171(2), 69\u201379 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR31","first-page":"179","volume":"227","author":"G. Zavattaro","year":"2009","unstructured":"Zavattaro, G.: Reachability analysis in bioambients. ENTCS\u00a0227, 179\u2013193 (2009)","journal-title":"ENTCS"},{"key":"11_CR32","first-page":"95","volume-title":"Handbook of Graph Grammars","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement, graph grammars. In: Handbook of Graph Grammars, pp. 95\u2013162. World Scientific, Singapore (1997)"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70545-1_21","volume-title":"Computer Aided Verification","author":"S. Joshi","year":"2008","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the graph minor theorem to the verification of graph transformation systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 214\u2013226. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"11_CR34","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! TCS\u00a0256(1-2), 63\u201392 (2001)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Computational Methods in Systems Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03845-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:25:39Z","timestamp":1739309139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03845-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038440","9783642038457"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03845-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}