A neural ordinary differential equations network (ODE-Net)-enabled reachability method ( Neuro-Reachability ) is devised for the dynamic verification of networked microgrids (NMs) with unidentified subsystems and heterogeneous uncertainties. Three new contributions are presented: 1) An ODE-Net-...

It is well known that positive linear systems have differences in the concepts and characterizations of the structural properties of reachability and controllability. In this paper, the reachability indices of a positive system are defined and consequently they are studied. For that, a canonical form of the reachability indices is given by positive similarity. From that canonical form, it is es...

This paper solves two open problems about the decidability of the vector reachability problem over a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from SL(2,Z). The approach to solving reachability problems is based on the characterization of reachability path...

We establish a relationship between reachability problems in timed automata and spacebounded counter automata. We show that reachability in timed automata with three or more clocks is logarithmic-space inter-reducible with reachability in space-bounded counter automata with two counters. We moreover show the logarithmic-space equivalence of reachability in two-clock timed automata and space-bou...

A recent result has shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded onecounter automata [6]. We show that reachability in bounded one-counter automata is PSPACE-complete.