Pages that link to "Item:Q1856193"
From MaRDI portal
The following pages link to HyTech: A model checker for hybrid systems (Q1856193):
Displayed 34 items.
- HyTech (Q16310) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← 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)
- An algebra of hybrid systems (Q1001892) (← links)
- What's decidable about hybrid automata? (Q1273866) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Process algebra for hybrid systems (Q1781998) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Positive loop-closed automata: A decidable class of hybrid systems (Q1858439) (← links)
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice (Q1884863) (← links)
- Updatable timed automata (Q1885906) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- Continuity controlled hybrid automata (Q2368692) (← links)
- CTL* model checking for time Petri nets (Q2368992) (← links)
- Algorithmic analysis of polygonal hybrid systems. I: Reachability (Q2373713) (← links)
- Optimal reachability for multi-priced timed automata (Q2474054) (← links)
- Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools (Q2474069) (← links)
- Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties (Q2481211) (← links)
- Hybrid abstractions of affine systems (Q2496812) (← links)
- Bisimulation for labelled Markov processes (Q2506488) (← links)
- Denotational semantics of hybrid automata (Q2643331) (← links)
- Reachability and optimal control for linear hybrid automata: a quantifier elimination approach (Q3447004) (← links)
- Approximating Continuous Systems by Timed Automata (Q3506869) (← links)
- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space (Q3510811) (← links)
- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph (Q3543304) (← links)
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (Q3617770) (← links)
- A Kleene-Schützenberger Theorem for Weighted Timed Automata (Q5458356) (← links)
- HYBRID SYSTEM VERIFICATION IS NOT A SINECURE — THE ELECTRONIC THROTTLE CONTROL CASE STUDY (Q5484908) (← links)
- Efficient Symbolic Representations for Arithmetic Constraints in Verification (Q5696928) (← links)