{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"last_name":"Chonev","full_name":"Chonev, Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}],"intvolume":"        55","citation":{"chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>.","mla":"Chonev, Ventsislav K., et al. <i>On the Skolem Problem for Continuous Linear Dynamical Systems</i>. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016."},"department":[{"_id":"KrCh"}],"alternative_title":["LIPIcs"],"scopus_import":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers."}],"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"type":"conference","month":"08","oa_version":"Published Version","date_created":"2018-12-11T11:49:59Z","date_published":"2016-08-01T00:00:00Z","file_date_updated":"2018-12-12T10:16:26Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","ec_funded":1,"status":"public","title":"On the skolem problem for continuous linear dynamical systems","ddc":["004","006"],"doi":"10.4230/LIPIcs.ICALP.2016.100","publist_id":"6314","acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307:  Graph Games), and ERC Advanced Grant (267989: QUAREM).","file":[{"date_created":"2018-12-12T10:16:26Z","content_type":"application/pdf","file_size":521415,"file_id":"5213","relation":"main_file","creator":"system","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","access_level":"open_access","date_updated":"2018-12-12T10:16:26Z"}],"date_updated":"2021-01-12T06:48:03Z","article_number":"100","conference":{"location":"Rome, Italy","start_date":"2016-07-12","end_date":"2016-07-15","name":"ICALP: Automata, Languages and Programming"},"_id":"1069","volume":55,"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","year":"2016","day":"01","language":[{"iso":"eng"}],"oa":1,"license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","pubrep_id":"778"}