{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:36Z","timestamp":1725798636659},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_11","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:12:23Z","timestamp":1407823943000},"page":"123-134","source":"Crossref","is-referenced-by-count":12,"title":["Advances in Parametric Real-Time Reasoning"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Bundala","sequence":"first","affiliation":[]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proceedings of the 25th Annual Symposium on Theory of Computing. ACM Press (1993)","DOI":"10.1145\/167088.167242"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","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. Information Processing Letters\u00a0102(5), 208\u2013213 (2007)","journal-title":"Information Processing Letters"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-39212-2_21","volume-title":"Automata, Languages, and Programming","author":"J. Fearnley","year":"2013","unstructured":"Fearnley, J., Jurdzi\u0144ski, M.: Reachability in two-clock timed automata is PSPACE-Complete. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 212\u2013223. Springer, Heidelberg (2013)"},{"key":"11_CR4","unstructured":"Haase, C.: On the Complexity of Model Checking Counter Automata. PhD thesis, University of Oxford (2012)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-04081-8_25","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C. Haase","year":"2009","unstructured":"Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 369\u2013383. Springer, Heidelberg (2009)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-33512-9_6","volume-title":"Reachability Problems","author":"C. Haase","year":"2012","unstructured":"Haase, C., Ouaknine, J., Worrell, J.: On the relationship between reachability problems in timed and counter automata. In: Finkel, A., Leroux, J., Potapov, I. (eds.) RP 2012. LNCS, vol.\u00a07550, pp. 54\u201365. Springer, Heidelberg (2012)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 545\u2013558. Springer, Heidelberg (1992)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-45319-9_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Hune","year":"2001","unstructured":"Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.: Linear parametric model checking of timed automata. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 189\u2013203. Springer, Heidelberg (2001)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-56939-1_82","volume-title":"Automata, Languages and Programming","author":"O.H. Ibarra","year":"1993","unstructured":"Ibarra, O.H., Jiang, T., Tr\u00e2n, N., Wang, H.: New decidability results concerning two-way counter machines and applications. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 313\u2013324. Springer, Heidelberg (1993)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 401\u2013415. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36742-7_28"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for AC-like equational theories with homomorphisms. In: Research Report LSV-04-16, LSV, ENS de Cachan (2004)","DOI":"10.1007\/978-3-540-32033-3_23"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lipshitz, L.: The Diophantine Problem for Addition and Divisibility. Transactions of the American Mathematical Society, 235 (1978)","DOI":"10.2307\/1998219"},{"key":"11_CR13","unstructured":"Lipshitz, L.: Some remarks on the diophantine problem for addition and divisibility, vol.\u00a033 (1981)"},{"key":"11_CR14","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":"J.S. Miller","year":"2000","unstructured":"Miller, J.S.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, N., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.\u00a01790, pp. 296\u2013310. Springer, Heidelberg (2000)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/3-540-36580-X_28","volume-title":"Hybrid Systems: Computation and Control","author":"J. Ouaknine","year":"2003","unstructured":"Ouaknine, J., Worrell, J.B.: Universality and language inclusion for open and closed timed automata. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol.\u00a02623, pp. 375\u2013388. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:54:41Z","timestamp":1558954481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}