HyTech

swMATH4125MaRDI QIDQ16310FDOQ16310

Author name not available (Why is that?)

Described by source

• HyTech: A model checker for hybrid systems

Cited In (only showing first 100 items - show all)

• A survey of timed automata for the development of real-time systems
• Fixpoint-Guided Abstraction Refinements
• Algorithmic analysis of polygonal hybrid systems. I: Reachability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modelling and analysing neural networks using a hybrid process algebra
• Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
• Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp>
• Formal Modeling and Analysis of Timed Systems
• HYPE: hybrid modelling by composition of flows
• Semantics and pragmatics of real-time maude
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
• Hybrid automata as a modelling approach in the behavioural sciences
• Languages and Tools for Hybrid Systems Design
• Reachability analysis of linear systems with stepwise constant inputs
• SPHIN: a model checker for reconfigurable hybrid systems based on SPIN
• Differential dynamic logic for hybrid systems
• COLIN: planning with continuous linear numeric change
• Efficient constraint/generator removal from double description of polyhedra
• An algebra of hybrid systems
• Hybrid dynamics of stochastic programs
• Title not available (Why is that?)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Testing timed automata
• Hybrid Systems: Computation and Control
• KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
• Combining Widening and Acceleration in Linear Relation Analysis
• MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
• Foundations of algebraic specification and formal software development.
• What's decidable about hybrid automata?
• Discrete-time control for rectangular hybrid automata
• Approximating labelled Markov processes
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Specification of real-time and hybrid systems in rewriting logic
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• Process algebra for hybrid systems
• Updatable timed automata
• Title not available (Why is that?)
• Computing differential invariants of hybrid systems as fixed points
• Optimal reachability for multi-priced timed automata
• Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis
• Syntax and consistent equation semantics of hybrid Chi
• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistical Model Checking for Networks of Priced Timed Automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Priced timed automata: theory and tools
• Bisimulation for labelled Markov processes
• Model-checking Timed Temporal Logics
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Sapo
• Avoiding geometric intersection operations in reachability analysis of hybrid systems
• Reachability and observability reduction for linear switched systems with constrained switching
• Title not available (Why is that?)
• Parameter synthesis for hierarchical concurrent real-time systems
• Dynamical Properties of Timed Automata Revisited
• Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k
• Computing reachable states for nonlinear biological models
• Constructing invariants for hybrid systems
• Title not available (Why is that?)
• Hybrid automata, reachability, and systems biology
• Hybrid Systems: Computation and Control
• Not necessarily closed convex polyhedra and the double description method
• Finite data-rate feedback stabilization of switched and hybrid linear systems
• Hybrid Automata in Systems Biology: How Far Can We Go?
• Perspectives of System Informatics
• Constraint-based deductive model checking
• Denotational semantics of hybrid automata
• A quadratic-time DBM-based successor algorithm for checking timed automata
• On Reachability for Hybrid Automata over Bounded Time
• Title not available (Why is that?)
• Parameter Synthesis for Hybrid Systems with an Application to Simulink Models
• Model Checking Genetic Regulatory Networks with Parameter Uncertainty
• Modeling and simulation of cardiac tissue using hybrid I/O automata
• Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
• Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
• Constraint-Based Approach for Analysis of Hybrid Systems
• Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space
• Title not available (Why is that?)
• Using Redundant Constraints for Refinement
• Automatic synthesis of switching controllers for linear hybrid systems: safety control
• Automatic Verification of Hybrid Systems with Large Discrete State Space
• Symbolic Unfoldings for Networks of Timed Automata
• Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
• Forward analysis of updatable timed automata
• Safety verification for probabilistic hybrid systems
• Title not available (Why is that?)
• Hybrid Systems: Computation and Control
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
• Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction
• Parametric probabilistic transition systems for system design and analysis
• Title not available (Why is that?)
• Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
• A compared study of two correctness proofs for the standardized algorithm of ABR conformance
• Efficient Symbolic Representations for Arithmetic Constraints in Verification

This page was built for software: HyTech