Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Within hybrid systems theory, o-minimal automata are often considered on the border beten decidability and undecidability. In such classes of hybrid automata, the constraint of having only constant reset upon discrete jumps is a strong limitation for their applicability: hence, an important issue for both theoreticians and practitioners, is that of relaxing the above constraint, while not fall into undecidability.   start considering the problem of timed-bounded reachability on o-minimal automata. This can be seen either as a reachability problem paired with time-constraints or as a classical reachability problem for a class of hybrid automata which properly extends the o-minimal one, with an extra variable representing time. Then,  directly face the problem of extending o-minimal automata by allowing some variables to retain their values upon a discrete jump, without crossing the undecidability border.
['Raffaella Gentilini']
I am writing a research paper on a idea Reachability problems on extended O-minimal hybrid automata
[{"from": "human", "value": "I am writing a research paper on a idea Reachability problems on extended O-minimal hybrid automata"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Within hybrid systems theory, o-minimal automata are often considered on the border beten decidability and undecidability. In such classes of hybrid automata, the constraint of having only constant reset upon discrete jumps is a strong limitation for their applicability: hence, an important issue for both theoreticians and practitioners, is that of relaxing the above constraint, while not fall into undecidability.   start considering the problem of timed-bounded reachability on o-minimal automata. This can be seen either as a reachability problem paired with time-constraints or as a classical reachability problem for a class of hybrid automata which properly extends the o-minimal one, with an extra variable representing time. Then,  directly face the problem of extending o-minimal automata by allowing some variables to retain their values upon a discrete jump, without crossing the undecidability border."}]