{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:53:46Z","timestamp":1743098026698,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319194875"},{"type":"electronic","value":"9783319194882"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19488-2_14","type":"book-chapter","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T05:13:45Z","timestamp":1433394825000},"page":"266-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing Stable Inequalities of Petri Nets"],"prefix":"10.1007","author":[{"given":"Marvin","family":"Triebel","sequence":"first","affiliation":[]},{"given":"Jan","family":"S\u00fcrmeli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"issue":"10","key":"14_CR1","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/BF01438223","volume":"14","author":"I Abdallah","year":"1998","unstructured":"Abdallah, I., ElMaraghy, H.: Deadlock prevention and avoidance in fms: A petri net based approach. The International Journal of Advanced Manufacturing Technology 14(10), 704\u2013715 (1998)","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for petri nets and commutative semigroups. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, pp. 50\u201354 (1976)","DOI":"10.1145\/800113.803630"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Colom, J.M., Silva, M.: Convex geometry and semiflows in P\/T nets. A comparative study of algorithms for computation of minimal p-semiflows. In: Proceedings of 10th International Conference on Applications and Theory of Petri Nets, Bonn, Germany, June 1989. Advances in Petri Nets 1990, pp. 79\u2013112 (1989)","DOI":"10.1007\/3-540-53863-1_22"},{"issue":"1\u20132","key":"14_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(95)00117-4","volume":"153","author":"J Desel","year":"1996","unstructured":"Desel, J., Neuendorf, K.P., Radola, M.D.: Proving nonreachability by modulo-invariants. Theoretical Computer Science 153(1\u20132), 49\u201364 (1996)","journal-title":"Theoretical Computer Science"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Desel, J.: Struktur und Analyse von Free-Choice-Petrinetzen. Deutscher Universit\u00e4tsverlag, DUV Informatik (1992)","DOI":"10.1007\/978-3-663-14543-1"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"EA Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201csometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time temporal logic. J. ACM 33(1), 151\u2013178 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/70.370500","volume":"11","author":"J Ezpeleta","year":"1995","unstructured":"Ezpeleta, J., Colom, J., Martinez, J.: A petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Transactions on Robotics and Automation 11(2), 173\u2013184 (1995)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ezpeleta, J., Couvreur, J., Silva, M.: A new technique for finding a generating family of siphons, traps and st-components. application to colored petri nets. In: Advances in Petri Nets 1993, Papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, pp. 126\u2013147 (1991)","DOI":"10.1007\/3-540-56689-9_42"},{"key":"14_CR9","unstructured":"Fischer, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic, pp. 27\u201341 (1974)"},{"key":"14_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York, NY, USA (1990)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, presburger formulas, and languages. Pacific Journal of Mathematics 16(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"14_CR12","unstructured":"Hack, M.: Analysis production schemata by Petri nets. Master\u2019s thesis, Massachusetts Institute of Technology, Cambridge, Mass (1972)"},{"key":"14_CR13","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. 5016, pp. 215\u2013264. Springer, Heidelberg (2008)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-47919-2_7","volume-title":"Petri Nets: Central Models and Their Properties","author":"K Lautenbach","year":"1987","unstructured":"Lautenbach, K.: Linear algebraic techniques for place\/transition nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties. Lecture Notes in Computer Science, vol. 254, pp. 142\u2013167. Springer, Berlin Heidelberg (1987)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The general vector addition system reachability problem by presburger inductive invariants. Logical Methods in Computer Science 6(3) (2010)","DOI":"10.2168\/LMCS-6(3:22)2010"},{"key":"14_CR16","unstructured":"Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Voronkov, A. (ed.) The Alan Turing Centenary Conference, Turing-100, Manchester UK June 22\u201325, 2012, Proceedings. EPiC Series, vol. 10, pp. 214\u2013228 (2012)"},{"key":"14_CR17","unstructured":"Mitchell, J.E.: Branch-and-cut algorithms for combinatorial optimization problems. Handbook of applied optimization, pp. 65\u201377 (2002)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. In: Proceedings of the IEEE, pp. 541\u2013580 (Apr 1989)","DOI":"10.1109\/5.24143"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"14_CR20","unstructured":"Pascoletti, K.H.: Diophantische Systeme und L\u00f6sungsmethoden zur Bestimmung aller Invarianten in Petri-Netzen. GMD-Bericht Nr. 160, R. Oldenbourg Verlag (1986)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods. Springer, Case Studies (2013)","DOI":"10.1007\/978-3-642-33278-4"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Silva, M., Teruel, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place or transition net systems. In: Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, pp. 309\u2013373 (1996)","DOI":"10.1007\/3-540-65306-6_19"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Starke, P.H.: Analyse von Petri-Netz-Modellen, pp. 1\u2013253 (1990)","DOI":"10.1007\/978-3-663-09262-9"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19488-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:49:31Z","timestamp":1676584171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19488-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319194875","9783319194882"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19488-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}