{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:06Z","timestamp":1740098886458,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319578606"},{"type":"electronic","value":"9783319578613"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57861-3_19","type":"book-chapter","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T02:10:40Z","timestamp":1493863840000},"page":"330-349","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets"],"prefix":"10.1007","author":[{"given":"Dimitri","family":"Watel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc-Antoine","family":"Weisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Barth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,5]]},"reference":[{"key":"19_CR1","unstructured":"Reaxys. Elsevier (2016). https:\/\/www.elsevier.com\/solutions\/reaxys"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-00596-1_25","volume-title":"Foundations of Software Science and Computational Structures","author":"PA Abdulla","year":"2009","unstructured":"Abdulla, P.A., Mayr, R.: Minimal cost reachability\/coverability in priced timed petri nets. In: Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 348\u2013363. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00596-1_25"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Mayr, R.: Computing optimal coverability costs in priced timed Petri nets. In: Proceedings of the Symposium on Logic in Computer Science, pp. 399\u2013408 (2011)","DOI":"10.1109\/LICS.2011.40"},{"issue":"4","key":"19_CR4","first-page":"1","volume":"9","author":"PA Abdulla","year":"2013","unstructured":"Abdulla, P.A., Mayr, R.: Priced timed Petri nets. Logical Methods Comput. Sci. 9(4), 1\u201351 (2013)","journal-title":"Logical Methods Comput. Sci."},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1759-2208-3-1","volume":"3","author":"JL Andersen","year":"2012","unstructured":"Andersen, J.L., Flamm, C., Merkle, D., Stadler, P.F.: Maximizing output and recognizing autocatalysis in chemical reaction networks is NP-complete. J. Syst. Chem. 3(1), 1\u20139 (2012). http:\/\/www.jsystchem.com\/content\/3\/1\/1","journal-title":"J. Syst. Chem."},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Angeli, D., De Leenheer, P., Sontag, E.: A Petri Net approach to the study of persistence in chemical reaction networks. Math. Biosci. 210(2), 598\u2013618 (2007). http:\/\/arxiv.org\/abs\/q-bio\/0608019","DOI":"10.1016\/j.mbs.2007.07.003"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1021\/op500373e","volume":"19","author":"A B\u00f8gevig","year":"2015","unstructured":"B\u00f8gevig, A., Federsel, H.J., Huerta, F., Hutchings, M.G., Kraut, H., Langer, T., L\u00f6w, P., Oppawsky, C., Rein, T., Saller, H.: Route design in the 21st century: the IC SYNTH software tool as an idea generator for synthesis prediction. Org. Process Res. Dev. 19(2), 357\u2013368 (2015)","journal-title":"Org. Process Res. Dev."},{"key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity, vol. 3. Springer, New York (1999). https:\/\/www.dagstuhl.de\/Reports\/01\/01311.pdf"},{"key":"19_CR9","unstructured":"Eigner-Pitto, V., Huerta, F.F., Hutchings, M.G., Saller, H., Loew, P.: Reaction prediction tools for both idea generation in new synthesis route planning and for de novo molecule design. In: 12th German Conference on Chemoinformatics (2016)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-56689-9_45","volume-title":"Advances in Petri Nets 1993","author":"A Finkel","year":"1993","unstructured":"Finkel, A.: The minimal coverability graph for Petri nets. In: Rozenberg, G. (ed.) ICATPN 1991. LNCS, vol. 674, pp. 210\u2013243. Springer, Heidelberg (1993). doi: 10.1007\/3-540-56689-9_45"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10270-014-0426-0","volume":"14","author":"A Finkel","year":"2015","unstructured":"Finkel, A., Leroux, J.: Recent and simple algorithms for Petri nets. Softw. Syst. Model. 14(2), 719\u2013725 (2015)","journal-title":"Softw. Syst. Model."},{"issue":"4","key":"19_CR12","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/s100090100058","volume":"3","author":"H Genrich","year":"2001","unstructured":"Genrich, H., K\u00fcffner, R., Voss, K.: Executable Petri net models for the analysis of metabolic pathways. Int. J. Softw. Tools Technol. Transf. 3(4), 394\u2013404 (2001)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"D1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"D456","DOI":"10.1093\/nar\/gks1146","volume":"41","author":"J Hastings","year":"2012","unstructured":"Hastings, J., de Matos, P., Dekker, A., Ennis, M., Harsha, B., Kale, N., Muthukrishnan, V., Owen, G., Turner, S., Williams, M., Steinbeck, C.: The chebi reference database and ontology for biologically relevant chemistry: enhancements for 2013. Nucleic Acids Res. 41(D1), D456 (2012). http:\/\/dx.doi.org\/10.1093\/nar\/gks1146","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s11047-011-9263-z","volume":"10","author":"M Heiner","year":"2011","unstructured":"Heiner, M.: Preface: Petri nets for systems and synthetic biology. Natural Comput. 10(3), 987\u2013992 (2011)","journal-title":"Natural Comput."},{"issue":"2","key":"19_CR15","first-page":"113","volume":"16","author":"R Hofest\u00e4dt","year":"1994","unstructured":"Hofest\u00e4dt, R.: A Petri net application to model metabolic processes. Syst. Anal. Model. Simul. 16(2), 113\u2013122 (1994)","journal-title":"Syst. Anal. Model. Simul."},{"key":"19_CR16","first-page":"64","volume":"9","author":"D Horvath","year":"2000","unstructured":"Horvath, D., Jeandenans, C.: Molecular similarity and virtual screening. In silico methods to retrieve active analogs in the context of discovering therapeutic compounds. Actual. Chim. 9, 64\u201367 (2000)","journal-title":"Actual. Chim."},{"issue":"5","key":"19_CR17","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1021\/ci00009a004","volume":"32","author":"AP Johnson","year":"1992","unstructured":"Johnson, A.P., Marshall, C.: Starting material oriented retrosynthetic analysis in the LHASA program. 2. Mapping the SM and target structures. J. Chem. Inf. Comput. Sci. 32(5), 418\u2013425 (1992)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones, N.D., Landweber, L.H., Edmund Lien, Y.: Complexity of some problems in Petri nets. Theoret. Comput. Sci. 4(3), 277\u2013299 (1977)","journal-title":"Theoret. Comput. Sci."},{"issue":"12","key":"19_CR19","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1002\/minf.201000086","volume":"29","author":"I Koch","year":"2010","unstructured":"Koch, I.: Petri nets-a mathematical formalism to analyze chemical reaction networks. Mol. Inform. 29(12), 838\u2013843 (2010)","journal-title":"Mol. Inform."},{"key":"19_CR20","unstructured":"Lipton, R.J.: The Reachability Problem Requires Exponential Space. Technical report, Yale Research Report #63 (1976)"},{"key":"19_CR21","unstructured":"Nouleho, S., Barth, D., David, O., Watel, D., Weisser, M.: A new definition of molecule similarity to determine molecular construction. Poster in 12th German Conference on Chemoinformatics (2016)"},{"key":"19_CR22","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Ph.D. Thesis, Universit\u00e4t Hamburg (1962). http:\/\/epub.sub.uni-hamburg.de\/informatik\/volltexte\/2011\/160\/"},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci. 6(2), 223\u2013231 (1978). http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397578900361","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR25","unstructured":"Reddy, V.N., Mavrovouniotis, M.L., Liebman, M.N.: Petri net representations in metabolic pathways. In: Proceedings of the International Conference on Intelligent Systems for Molecular Biology, vol. 1, pp. 328\u2013336 (1993)"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR27","unstructured":"Watel, D., Weisser, M.A.: A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem. Technical report, HAL (2016). https:\/\/hal.archives-ouvertes.fr\/hal-01377704"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57861-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T22:09:22Z","timestamp":1602022162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57861-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319578606","9783319578613"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57861-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}