Forward completeness implies robust forward completeness for time-delay systems
Forward completeness implies robust forward completeness for time-delay systems
Let the autonomous time-delay system be given on the history space . It is forward complete if every solution exists for all positive times, and it is robustly forward complete (RFC) in the sense of the paper's definition. FC–RFC conjecture. Forward completeness implies RFC. The equivalence between FC and RFC fails for general infinite-dimensional systems, so the issue is whether the special structure of time-delay systems makes the implication valid; the parser reports that this conjecture is disproved.
Sources & referencesView supporting material
Primary source
Antoine Chaillet, Iasson Karafyllis, Pierdomenico Pepe and Yuan Wang, “The ISS framework for time-delay systems: a survey”, arXiv:2206.06167 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.