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)

• Title not available (Why is that?)
• Petri net analysis using invariant generation
• 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
• Quantitative Model Checking for a Controller Design
• Rigorous simulation-based analysis of linear hybrid systems
• Title not available (Why is that?)
• Cyber-physical systems
• Action language verifier: An infinite-state model checker for reactive software specifications
• Verifying distributed real-time properties of embedded systems via graph transformations and model checking
• Model-based engineering of embedded systems using the hybrid process algebra Chi
• Trajectory Based Verification Using Local Finite-Time Invariance
• Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
• A survey of challenges for runtime verification from advanced application domains (beyond software)
• Title not available (Why is that?)
• Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
• PPLite: zero-overhead encoding of NNC polyhedra
• A compositional modelling and analysis framework for stochastic hybrid systems
• Constraint-based verification of parameterized cache coherence protocols
• Generating invariants for non-linear hybrid systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Hybrid automata-based CEGAR for rectangular hybrid systems
• The Theory of Timed I/O Automata
• Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation
• HRELTL: a temporal logic for hybrid systems
• Title not available (Why is that?)
• Change-of-bases abstractions for non-linear hybrid systems
• Composing stability proofs for hybrid systems
• Applications of MetiTarski in the Verification of Control and Hybrid Systems
• Timed Temporal Logics for Abstracting Transient States
• Time-triggered conversion of guards for reachability analysis of hybrid automata
• Parameter synthesis of polynomial dynamical systems
• Introduction to databases. From biological to spatio-temporal
• Title not available (Why is that?)
• Abstraction and completeness for real-time Maude
• From synchronous programs to symbolic representations of hybrid systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sampling-based algorithm for testing and validating robot controllers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal and robust controller synthesis using energy timed automata with uncertainty
• Symbolic model checking in non-Boolean domains
• Formal verification and quantitative metrics of MPSoC data dynamics
• Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
• Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking
• Deductive verification of real-time systems using STeP
• Bounded model checking for timed automata
• Geometric Model Checking of Continuous Space
• Title not available (Why is that?)
• 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
• 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
• Using redundant constraints for refinement
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• Process algebra for hybrid systems
• Assume-guarantee verification of nonlinear hybrid systems with ARIADNE

This page was built for software: HyTech