
arXiv: 2004.11661
Continuous linear dynamical systems are used extensively in mathematics, computer science, physics, and engineering to model the evolution of a system over time. A central technique for certifying safety properties of such systems is by synthesising inductive invariants. This is the task of finding a set of states that is closed under the dynamics of the system and is disjoint from a given set of error states. In this paper we study the problem of synthesising inductive invariants that are definable in o-minimal expansions of the ordered field of real numbers. In particular, assuming Schanuel's conjecture in transcendental number theory, we establish effective synthesis of o-minimal invariants in the case of semi-algebraic error sets. Without using Schanuel's conjecture, we give a procedure for synthesizing o-minimal invariants that contain all but a bounded initial segment of the orbit and are disjoint from a given semi-algebraic error set. We further prove that effective synthesis of semi-algebraic invariants that contain the whole orbit, is at least as hard as a certain open problem in transcendental number theory.
Full version of a ICALP 2020 paper
safety, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Invariants, o-minimality, Mathematics of computing → Continuous mathematics, Dynamical Systems (math.DS), Theory of computation → Finite Model Theory, Theory of computation → Logic and verification, 510, 004, Logic in Computer Science (cs.LO), Software and its engineering → Formal software verification, FOS: Mathematics, Computing methodologies → Algebraic algorithms, continuous Skolem problem, Mathematics - Dynamical Systems, Mathematics of computing → Continuous functions, continuous linear dynamical systems, ddc: ddc:004
safety, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Invariants, o-minimality, Mathematics of computing → Continuous mathematics, Dynamical Systems (math.DS), Theory of computation → Finite Model Theory, Theory of computation → Logic and verification, 510, 004, Logic in Computer Science (cs.LO), Software and its engineering → Formal software verification, FOS: Mathematics, Computing methodologies → Algebraic algorithms, continuous Skolem problem, Mathematics - Dynamical Systems, Mathematics of computing → Continuous functions, continuous linear dynamical systems, ddc: ddc:004
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
