Pages that link to "Item:Q673868"

The following pages link to The algorithmic analysis of hybrid systems (Q673868):

Displaying 22 items.

• A Hybrid Denotational Semantics for Hybrid Systems (Q5458386) (← links)
• Hybrid Systems: Computation and Control (Q5703927) (← links)
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems (Q5739458) (← links)
• Computer Aided Verification (Q5900679) (← 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)
• Symbolic reachability computation for families of linear vector fields (Q5945290) (← links)
• A first order logic for specification of timed algorithms: Basic properties and a decidable class (Q5957904) (← links)
• A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems (Q5958118) (← links)
• Modularity for timed and hybrid systems (Q6044109) (← links)
• Stability in measure and asymptotic stability of uncertain nonlinear switched systems with a practical application (Q6076645) (← links)
• Rewriting logic as a semantic framework for concurrency: a progress report (Q6104381) (← links)
• Symbolic analysis of linear hybrid automata -- 25 years later (Q6113970) (← links)
• Time distance-based computation of the \textit{DBM} over-approximation of preemptive real-time systems (Q6151616) (← links)
• State equivalences for rectangular hybrid automata (Q6162103) (← links)
• Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems (Q6175620) (← links)
• Design of controllers for linear hybrid systems (Q6560368) (← links)
• Reachability analysis of linear systems (Q6592109) (← links)
• Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe construction (Q6599370) (← links)
• A computable and compositional semantics for hybrid systems (Q6614877) (← links)