{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:21Z","timestamp":1762458921923},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_24","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T09:14:02Z","timestamp":1314263642000},"page":"358-372","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity Results for 1-safe Petri Nets"],"prefix":"10.1007","author":[{"given":"M.","family":"Praveen","sequence":"first","affiliation":[]},{"given":"Kamal","family":"Lodaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Alg.\u00a021(2), 358\u2013402 (1996)","journal-title":"J. Alg."},{"key":"24_CR2","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second-order arithmetic. In: Logic, Methodology, Philosophy and Science, pp. 1\u201311. Stanford Univ. Press, Stanford (1962)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.jcss.2005.11.003","volume":"72","author":"S. Demri","year":"2006","unstructured":"Demri, S., Laroussinie, F., Schnoebelen, P.: A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci.\u00a072(4), 547\u2013575 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. DIMACS, vol.\u00a049, pp. 49\u2013100 (1999)","DOI":"10.1090\/dimacs\/049\/04"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/176584.176587","volume":"41","author":"D. Drusinsky","year":"1994","unstructured":"Drusinsky, D., Harel, D.: On the power of bounded concurrency I: Finite automata. J. Assoc. Comput. Mach.\u00a041(3), 517\u2013539 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems \u2014 An introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. Information and Computation\u00a0187(2), 291\u2013319 (2003)","DOI":"10.1016\/S0890-5401(03)00161-5"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, E.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-63139-9_32","volume-title":"Application and Theory of Petri Nets 1997","author":"P. Habermehl","year":"1997","unstructured":"Habermehl, P.: On the complexity of the linear-time \u03bc-calculus for Petri-nets. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 102\u2013116. Springer, Heidelberg (1997)"},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res.\u00a012(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, A.R.: Weak monadic second order theory of succesor is not elementary-recursive. In: Proc. Logic Colloquium. Lecture Notes in Mathematics, vol.\u00a0453, pp. 132\u2013154 (1975)","DOI":"10.1007\/BFb0064872"},{"key":"24_CR16","unstructured":"Praveen, M.: Does treewidth help in modal satisfiability? (extended abstract). In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 580\u2013591. Springer, Heidelberg (2010), Full version http:\/\/arxiv.org\/abs\/1006.2461"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-17493-3_21","volume-title":"Parameterized and Exact Computation","author":"M. Praveen","year":"2010","unstructured":"Praveen, M.: Small vertex cover makes petri net coverability and boundedness easier. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 216\u2013227. Springer, Heidelberg (2010)"},{"key":"24_CR18","unstructured":"Praveen, M., Lodaya, K.: Modelchecking counting properties of 1-safe nets with buffers in parapspace. In: FSTTCS. LIPIcs, vol.\u00a04, pp. 347\u2013358 (2009)"},{"key":"24_CR19","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. Comp. Sci.\u00a06, 223\u2013231 (1978)","journal-title":"Theoret. Comp. Sci."},{"key":"24_CR20","unstructured":"Reutenauer, C.: The mathematics of Petri nets (1990); translated by Craig, I."},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M. Vardi","year":"1996","unstructured":"Vardi, M.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:45:13Z","timestamp":1560498313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}