The following pages link to HyTech (Q16310):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Hybrid automata as a modelling approach in the behavioural sciences (Q271714) (← links)
- Reachability analysis of linear systems with stepwise constant inputs (Q271719) (← links)
- Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
- Reachability and observability reduction for linear switched systems with constrained switching (Q340659) (← links)
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Automatic synthesis of switching controllers for linear hybrid systems: safety control (Q391117) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- HYPE: hybrid modelling by composition of flows (Q470011) (← links)
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (Q479819) (← links)
- Verifying global start-up for a Möbius ring-oscillator (Q479839) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Reachability computation for polynomial dynamical systems (Q526433) (← links)
- Computing reachable states for nonlinear biological models (Q533351) (← links)
- Monitoring of dynamic processes by rectangular hybrid automata (Q608376) (← links)
- Foundations of algebraic specification and formal software development. (Q610397) (← links)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- Bisimulation conversion and verification procedure for goal-based control systems (Q633304) (← links)
- Scheduler modeling based on the controller synthesis paradigm (Q698466) (← links)
- Fairness of transitions in diagnosability of discrete event systems (Q708892) (← links)
- Generalized property-directed reachability for hybrid systems (Q784143) (← links)
- Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction (Q832097) (← links)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability (Q832203) (← links)
- Formal verification of real-time systems with preemptive scheduling (Q844238) (← links)
- Action language verifier: An infinite-state model checker for reactive software specifications (Q845244) (← links)
- Verifying distributed real-time properties of embedded systems via graph transformations and model checking (Q853626) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← links)
- How to stop time stopping (Q855006) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- HRELTL: a temporal logic for hybrid systems (Q897648) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Approximate simulation relations for hybrid systems (Q939013) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking (Q947801) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- Hybrid dynamics of stochastic programs (Q969181) (← links)
- An algebra of hybrid systems (Q1001892) (← links)
- Event-driven optimization-based control of hybrid systems with integral continuous-time dynamics (Q1023146) (← links)
- Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation (Q1026394) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
