Pages that link to "Item:Q1367528"
From MaRDI portal
The following pages link to Reachability analysis of dynamical systems having piecewise-constant derivatives (Q1367528):
Displaying 22 items.
- Reachability in Linear Dynamical Systems (Q3507439) (← links)
- Updatable Timed Automata with Additive and Diagonal Constraints (Q3507456) (← links)
- STORMED Hybrid Systems (Q3519497) (← links)
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization (Q3523125) (← links)
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS (Q3526544) (← links)
- Modelling hybrid production systems through the ACD specification: a case study in the fibre-glass industry (Q3533185) (← links)
- Computing Omega-Limit Sets in Linear Dynamical Systems (Q3543335) (← links)
- CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES (Q3552522) (← links)
- Interrupt Timed Automata (Q3617730) (← links)
- Some bounds on the computational power of piecewise constant derivative systems (extended abstract) (Q4571947) (← links)
- Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Computable analysis with applications to dynamic systems (Q5220187) (← links)
- (Q5522469) (← links)
- Computation in gene networks (Q5705391) (← links)
- Achilles and the tortoise climbing up the arithmetical hierarchy (Q5906326) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Deciding stability and mortality of piecewise affine dynamical systems (Q5941097) (← links)
- The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
- Timed automata verification and synthesis via finite automata learning (Q6536137) (← links)
- Reachability analysis of a class of hybrid gene regulatory networks (Q6623014) (← links)
