{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:52Z","timestamp":1725486712457},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73094-1_27","type":"book-chapter","created":{"date-parts":[[2007,6,30]],"date-time":"2007-06-30T01:53:56Z","timestamp":1183168436000},"page":"465-483","source":"Crossref","is-referenced-by-count":1,"title":["Computing Minimal Elements of Upward-Closed Sets for Petri Nets"],"prefix":"10.1007","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\/2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P. Abdulla","year":"2000","unstructured":"Abdulla, P., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1\/2), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theoret. Comput. Sci.\u00a0126, 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T., Vardi, M.: Parametric real-time reasoning. In: Proc. 25th ACM STOC, pp, 592\u2013601 (1993)","DOI":"10.1145\/167088.167242"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"STACS 99","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Mayr, R.: Model checking lossy vector addition systems. In: Meinel, C., Tison, S. (eds.) STACS\u2019 99. LNCS, vol.\u00a01563, pp. 323\u2013333. Springer, Heidelberg (1999)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2041711","volume":"55","author":"I. Borosh","year":"1976","unstructured":"Borosh, I., Treybis, L.: Bounds on positive integral solutions to linear diophantine equations. Proc. Amer. Math. Soc.\u00a055, 299\u2013304 (1976)","journal-title":"Proc. Amer. Math. Soc."},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-46419-0_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"2000","unstructured":"Delzanno, G., Raskin, J.: Symbolic representation of upward-closed sets. In: Schwartzbach, M.I., Graf, S. (eds.) ETAPS 2000 and TACAS 2000. LNCS, vol.\u00a01785, pp. 426\u2013440. Springer, Heidelberg (2000)"},{"key":"27_CR7","first-page":"268","volume-title":"J. Software Tools for Technology Transfer","author":"G. Delzanno","year":"2004","unstructured":"Delzanno, G., Raskin, J., Van Begin, L.: Covering sharing-trees: a compact data-structure for parametrized verification. In: J. Software Tools for Technology Transfer, vol.\u00a05(2-3), pp. 268\u2013297. Springer, Heidelberg (2004)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 - an introduction. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"issue":"3","key":"27_CR9","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics\u00a030(3), 143\u2013160 (1994)","journal-title":"Journal of Informatik Processing and Cybernetics"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(93)90046-Y","volume":"46","author":"R. Howell","year":"1993","unstructured":"Howell, R., Rosier, L., Yen, H.: Normal and sinkless Petri nets. J. Comput. System Sci.\u00a046, 1\u201326 (1993)","journal-title":"J. Comput. System Sci."},{"key":"27_CR11","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.\u00a06, 223\u2013231 (1978)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"L. Rosier","year":"1986","unstructured":"Rosier, L., Yen, H.: A multiparameter analysis of the boundedness problem for vector addition systems. J. Comput. System Sci.\u00a032, 105\u2013135 (1986)","journal-title":"J. Comput. System Sci."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability in Petri nets. Acta Informatica\u00a021, 643\u2013674 (1985)","journal-title":"Acta Informatica"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-45089-0_4","volume-title":"Implementation and Application of Automata","author":"F. Wang","year":"2003","unstructured":"Wang, F., Yen, H.: Timing parameter characterization of real-time systems. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 23\u201334. Springer, Heidelberg (2003)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(84)90038-0","volume":"31","author":"H. Yamasaki","year":"1984","unstructured":"Yamasaki, H.: Normal Petri nets. Theoret. Comput. Sci.\u00a031, 307\u2013315 (1984)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s002240000127","volume":"32","author":"H. Yen","year":"1999","unstructured":"Yen, H.: Integer linear programming and the analysis of some Petri net problems. Theory of Computing Systems\u00a032(4), 467\u2013485 (1999)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73094-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:11:49Z","timestamp":1605744709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73094-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730934"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73094-1_27","relation":{},"subject":[]}}