{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T02:05:51Z","timestamp":1790647551335,"version":"4.1.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319478456","type":"print"},{"value":"9783319478463","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47846-3_25","type":"book-chapter","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T02:53:57Z","timestamp":1476413637000},"page":"400-416","source":"Crossref","is-referenced-by-count":18,"title":["Decision Problems for Parametric Timed Automata"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Didier","family":"Lime","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,10,15]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"crossref","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"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592\u2013601. ACM (1993)","DOI":"10.1145\/167088.167242"},{"key":"25_CR3","series-title":"Communications in Computer and Information Science","first-page":"1","volume-title":"Formal Techniques for Safety-Critical Systems","author":"\u00c9 Andr\u00e9","year":"2015","unstructured":"Andr\u00e9, \u00c9.: What\u2019s decidable about parametric timed automata? In: \u00d6lveczky, P.C., Artho, C. (eds.) Formal Techniques for Safety-Critical Systems. CCIS, vol. 596, pp. 1\u201317. Springer, Heidelberg (2015)"},{"issue":"5","key":"25_CR4","first-page":"819","volume":"20","author":"\u00c9 Andr\u00e9","year":"2009","unstructured":"Andr\u00e9, \u00c9., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. IJFCS 20(5), 819\u2013836 (2009)","journal-title":"IJFCS"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9., Lime, D.: Liveness in L\/U-parametric timed automata (2016, submitted). https:\/\/hal.archives-ouvertes.fr\/hal-01304232","DOI":"10.1109\/ACSD.2017.19"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-24537-9_2","volume-title":"Reachability Problems","author":"\u00c9 Andr\u00e9","year":"2015","unstructured":"Andr\u00e9, \u00c9., Lime, D., Roux, O.H.: Integer-complete synthesis for bounded parametric timed automata. In: Bojanczyk, M., et al. (eds.) RP 2015. LNCS, vol. 9328, pp. 7\u201319. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24537-9_2"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-44878-7_2","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"\u00c9 Andr\u00e9","year":"2016","unstructured":"Andr\u00e9, \u00c9., Lime, D., Roux, O.H.: On the expressiveness of parametric timed automata. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 19\u201334. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-44878-7_2"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-662-47666-6_6","volume-title":"Automata, Languages, and Programming","author":"N Bene\u0161","year":"2015","unstructured":"Bene\u0161, N., Bezd\u011bk, P., Larsen, K.G., Srba, J.: Language emptiness of continuous-time parametric timed automata. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 69\u201381. Springer, Heidelberg (2015)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","first-page":"87","volume-title":"Lectures on Concurrency and Petri Nets","author":"JE Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10703-009-0074-0","volume":"35","author":"L Bozzelli","year":"2009","unstructured":"Bozzelli, L., La Torre, S.: Decision problems for lower\/upper bound parametric timed automata. Formal Methods Syst. Des. 35(2), 121\u2013151 (2009)","journal-title":"Formal Methods Syst. Des."},{"issue":"5","key":"25_CR11","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.ipl.2006.11.018","volume":"102","author":"L Doyen","year":"2007","unstructured":"Doyen, L.: Robust parametric reachability for timed automata. Inf. Process. Lett. 102(5), 208\u2013213 (2007)","journal-title":"Inf. Process. Lett."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T Henzinger","year":"1998","unstructured":"Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? J. Comput. Syst. Sci. 57, 94\u2013124 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR13","first-page":"183","volume":"52\u201353","author":"T Hune","year":"2002","unstructured":"Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. JLAP 52\u201353, 183\u2013220 (2002)","journal-title":"JLAP"},{"issue":"5","key":"25_CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TSE.2014.2357445","volume":"41","author":"A Jovanovi\u0107","year":"2015","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. Trans. Softw. Eng. 41(5), 445\u2013461 (2015)","journal-title":"Trans. Softw. Eng."},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-46430-1_26","volume-title":"Hybrid Systems: Computation and Control","author":"JS Miller","year":"2000","unstructured":"Miller, J.S.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 296\u2013309. Springer, Heidelberg (2000)"},{"key":"25_CR16","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Inc., Upper Saddle River (1967)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47846-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T11:53:47Z","timestamp":1568462027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47846-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319478456","9783319478463"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47846-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}