{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:22Z","timestamp":1742913562598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031614323"},{"type":"electronic","value":"9783031614330"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-61433-0_12","type":"book-chapter","created":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T16:02:01Z","timestamp":1718208121000},"page":"244-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symbolic Domains and\u00a0Reachability for\u00a0Nets with\u00a0Trajectories"],"prefix":"10.1007","author":[{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prerak","family":"Contractor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45740-2_5","volume-title":"Applications and Theory of Petri Nets 2001","author":"PA Abdulla","year":"2001","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Timed petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53\u201370. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45740-2_5"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R Alur","year":"1995","unstructured":"Alur, R., et al.: The algorithmic analysis of hybrid systems. TCS 138(1), 3\u201334 (1995)","journal-title":"TCS"},{"issue":"2","key":"12_CR3","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.L.: A theory of timed automata. TCS 126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R Alur","year":"1995","unstructured":"Alur, R., et al.: The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138(1), 3\u201334 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B Berthomieu","year":"1991","unstructured":"Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Softw. Eng. 17(3), 259\u2013273 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1093\/comjnl\/36.5.463","volume":"36","author":"V Chandru","year":"1993","unstructured":"Chandru, V.: Variable elimination in linear constraints. Comput. J. 36(5), 463\u2013472 (1993)","journal-title":"Comput. J."},{"issue":"1 &2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. TCS 147(1 &2), 117\u2013136 (1995)","journal-title":"TCS"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Automata Theory and Formal Languages, pp. 134\u2013183 (1975)","DOI":"10.1007\/3-540-07407-4_17"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Dantzig, G., Eaves, B.C.: Fourier-Motzkin elimination and its dual. J. Comb. Theory, Ser. A 14(3), 288\u2013297 (1973)","DOI":"10.1016\/0097-3165(73)90004-6"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"12_CR11","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.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"12_CR12","unstructured":"Esparza, J.: Petri nets lecture notes. Technical report, 2019"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-44988-4_12","volume-title":"Application and Theory of Petri Nets 2000","author":"DF Escrig","year":"2000","unstructured":"Escrig, D.F., Ruiz, V.V., Alonso, O.M.: Decidability of properties of timed-arc petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 187\u2013206. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44988-4_12"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"H\u00e9lou\u00ebt, L., Agrawal, P.: Waiting nets. In: Bernardinello, L., Petrucci, L. (eds.) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2022. LNCS, vol. 13288, pp. 67\u201389. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06653-5_4","DOI":"10.1007\/978-3-031-06653-5_4"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"H\u00e9lou\u00ebt, L., Contractor, P.: Symbolic domains and reachability for nets with trajectories (long version). Technical report, Inria, 2024. https:\/\/inria.hal.science\/hal-04528235","DOI":"10.1007\/978-3-031-61433-0_12"},{"issue":"3","key":"12_CR16","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., Lien, Y.E.: Complexity of some problems in Petri nets. Theor. Comput. Sci. 4(3), 277\u2013299 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR17","unstructured":"Kecir, K.: Performance Evaluation of Urban Rail Traffic Management Techniques. (\u00c9valuation de Performances pour les Techniques de R\u00e9gulation du Trafic Ferroviaire Urbain). PhD thesis, University of Rennes 1, France, 2019"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10626-006-8133-9","volume":"16","author":"D Lime","year":"2006","unstructured":"Lime, D., Roux, O.H.: Model checking of time Petri nets using the state class timed automaton. Discret. Event Dyn. Syst. 16(2), 179\u2013205 (2006)","journal-title":"Discret. Event Dyn. Syst."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 11\u201313 May 1981, Milwaukee, Wisconsin, USA, pp. 238\u2013246. ACM (1981)","DOI":"10.1145\/800076.802477"},{"key":"12_CR20","unstructured":"Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine, CA, USA (1974)"},{"key":"12_CR21","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. Theor. Comput. Sci. 6, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-04081-8_37","volume-title":"CONCUR 2009 - Concurrency Theory","author":"P-A Reynier","year":"2009","unstructured":"Reynier, P.-A., Sangnier, A.: Weak time Petri nets strike back! In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 557\u2013571. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_37"},{"key":"12_CR23","unstructured":"Ruiz, V.V., Gomez, F.C., de Frutos-Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: PNPM, p. 188. IEEE Computer Society (1999)"},{"issue":"2","key":"12_CR24","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(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR25","unstructured":"Tarski, A.: A decision method for elementary algebra and geometry. Technical report, RAND Corporation, 1957"}],"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-031-61433-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T18:03:37Z","timestamp":1732212217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-61433-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031614323","9783031614330"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-61433-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Geneva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.unige.ch\/petrinets2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}