Pages that link to "Item:Q1273866"

The following pages link to What's decidable about hybrid automata? (Q1273866):

Displaying 21 items.

• Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
• Reachability analysis of linear systems with stepwise constant inputs (Q271719) (← links)
• Computation with perturbed dynamical systems (Q355515) (← links)
• Safety verification for probabilistic hybrid systems (Q389835) (← links)
• Automatic synthesis of switching controllers for linear hybrid systems: safety control (Q391117) (← links)
• Modular discrete time approximations of distributed hybrid automata (Q418807) (← links)
• Bisimulations for fuzzy automata (Q423147) (← links)
• Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
• Interrupt timed automata: verification and expressiveness (Q453513) (← links)
• Finite-state automata in information technologies (Q464949) (← links)
• SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (Q479819) (← links)
• Qualitative fault tolerance analysis for a class of hybrid systems (Q534384) (← links)
• Monitoring of dynamic processes by rectangular hybrid automata (Q608376) (← links)
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
• Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
• Topologies, Continuity and Bisimulations (Q4943548) (← links)
• (Q5002811) (← links)
• (Q5079750) (← links)
• Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
• Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp> (Q5408048) (← links)