<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>On recurrent reachability for continuous linear dynamical systems</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Ventsislav K</namePart>
  <namePart type="family">Chonev</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">36CBE2E6-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Joël</namePart>
  <namePart type="family">Ouaknine</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">James</namePart>
  <namePart type="family">Worrell</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">KrCh</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>LICS: Logic in Computer Science</namePart>
</name>



<name type="corporate">
  <namePart>Quantitative Graph Games: Theory and Applications</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Rigorous Systems Engineering</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Quantitative Reactive Modeling</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">The continuous evolution of a wide variety of systems, including continous-time Markov chains and linear hybrid automata, can be
described in terms of linear differential equations. In this paper we study the decision problem of whether the solution x(t) of a system of linear differential equations dx/dt = Ax reaches a target halfspace infinitely often. This recurrent reachability problem can
equivalently be formulated as the following Infinite Zeros Problem: does a real-valued function f:R≥0 --&amp;gt; R satisfying a given linear
differential equation have infinitely many zeros? Our main decidability result is that if the differential equation has order at most 7, then the Infinite Zeros Problem is decidable. On the other hand, we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision.</abstract>

<originInfo><publisher>IEEE</publisher><dateIssued encoding="w3cdtf">2016</dateIssued><place><placeTerm type="text">New York, NY, USA</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>LICS &apos;16</title></titleInfo>
  <identifier type="arXiv">1507.03632</identifier>
  <identifier type="ISI">000387609200052</identifier><identifier type="doi">10.1145/2933575.2934548</identifier>
<part><extent unit="pages">515 - 524</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ieee>V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in &lt;i&gt;LICS ’16&lt;/i&gt;, New York, NY, USA, 2016, pp. 515–524.</ieee>
<mla>Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” &lt;i&gt;LICS ’16&lt;/i&gt;, IEEE, 2016, pp. 515–24, doi:&lt;a href=&quot;https://doi.org/10.1145/2933575.2934548&quot;&gt;10.1145/2933575.2934548&lt;/a&gt;.</mla>
<chicago>Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” In &lt;i&gt;LICS ’16&lt;/i&gt;, 515–24. IEEE, 2016. &lt;a href=&quot;https://doi.org/10.1145/2933575.2934548&quot;&gt;https://doi.org/10.1145/2933575.2934548&lt;/a&gt;.</chicago>
<ama>Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: &lt;i&gt;LICS ’16&lt;/i&gt;. IEEE; 2016:515-524. doi:&lt;a href=&quot;https://doi.org/10.1145/2933575.2934548&quot;&gt;10.1145/2933575.2934548&lt;/a&gt;</ama>
<apa>Chonev, V. K., Ouaknine, J., &amp;#38; Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In &lt;i&gt;LICS ’16&lt;/i&gt; (pp. 515–524). New York, NY, USA: IEEE. &lt;a href=&quot;https://doi.org/10.1145/2933575.2934548&quot;&gt;https://doi.org/10.1145/2933575.2934548&lt;/a&gt;</apa>
<short>V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.</short>
<ista>Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524.</ista>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>1389</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:51:44Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-22T07:31:08Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
