PHAVer

swMATH4123MaRDI QIDQ16309FDOQ16309

Author name not available (Why is that?)

Described by source

• Hybrid Systems: Computation and Control

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

• Modelling and analysing neural networks using a hybrid process algebra
• Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction
• Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp>
• 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
• Towards Component Based Design of Hybrid Systems: Safety and Stability
• Towards an efficient path-oriented tool for bounded reachability analysis of linear hybrid systems using linear programming
• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Formal Modeling and Analysis of Timed Systems
• Approximate simulation relations for hybrid systems
• Hybrid Systems: Computation and Control
• Fairness of transitions in diagnosability of discrete event systems
• SPHIN: a model checker for reconfigurable hybrid systems based on SPIN
• Differential dynamic logic for hybrid systems
• Efficient constraint/generator removal from double description of polyhedra
• Hybrid Systems: Computation and Control
• KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
• MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
• Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming
• Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
• A survey of challenges for runtime verification from advanced application domains (beyond software)
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• Composing Reachability Analyses of Hybrid Systems for Safety and Stability
• PPLite: zero-overhead encoding of NNC polyhedra
• A compositional modelling and analysis framework for stochastic hybrid systems
• Foundations of a Compositional Interchange Format for Hybrid Systems
• Hybridization methods for the analysis of nonlinear systems
• Computing differential invariants of hybrid systems as fixed points
• Monitoring of dynamic processes by rectangular hybrid automata
• Don't care words with an application to the automata-based approach for real addition
• Rigorous Simulation-Based Analysis of Linear Hybrid Systems
• Almost ASAP semantics: from timed models to timed implementations
• Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Computing Differential Invariants of Hybrid Systems as Fixedpoints
• Verification of Hybrid Systems
• Syntax and consistent equation semantics of hybrid Chi
• Reachable set computation for uncertain time-varying linear systems
• Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation
• HRELTL: a temporal logic for hybrid systems
• Statistical Model Checking for Networks of Priced Timed Automata
• Hybrid abstractions of affine systems
• HYST
• SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
• Change-of-bases abstractions for non-linear hybrid systems
• Reachability and observability reduction for linear switched systems with constrained switching
• Crossing the Bridge between Similar Games
• Trajectory-Based Theory for Hybrid Systems
• Bisimulation conversion and verification procedure for goal-based control systems
• Applications of MetiTarski in the Verification of Control and Hybrid Systems
• Approximating Continuous Systems by Timed Automata
• Computing reachable states for nonlinear biological models
• Temporal Logic Verification Using Simulation
• Hybrid Systems: Computation and Control
• Diagnosability of delay-deadline failures in fair real time discrete event models
• Finite data-rate feedback stabilization of switched and hybrid linear systems
• Robust Test Generation and Coverage for Hybrid Systems
• Verifying global start-up for a Möbius ring-oscillator
• The Structure of Differential Invariants and Differential Cut Elimination
• On Reachability for Hybrid Automata over Bounded Time
• Parameter Synthesis for Hybrid Systems with an Application to Simulink Models
• Reachability Analysis of Hybrid Systems Using Support Functions
• Bellerophon: tactical theorem proving for hybrid systems
• Differential Dynamic Logic for Verifying Parametric Hybrid Systems
• Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
• Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking
• Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems
• Symbolic Reachability Analysis of Lazy Linear Hybrid Automata
• 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
• Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Composing Stability Proofs for Hybrid Systems
• Reachability computation for polynomial dynamical systems
• Safety verification for probabilistic hybrid systems
• Reachability games for linear hybrid systems
• An Introduction to the Verification of Hybrid Systems Using Ariadne
• Reachability Analysis of Non-linear Planar Autonomous Systems
• Symbolic Model Checking in Non-Boolean Domains
• Automating Verification of Cooperation, Control, and Design in Traffic Applications
• d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
• Lyapunov abstractions for inevitability of hybrid systems
• Model-based engineering of embedded systems using the hybrid process algebra Chi
• Trajectory Based Verification Using Local Finite-Time Invariance
• On the efficiency of convex polyhedra
• Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*
• Efficient Bounded Reachability Computation for Rectangular Automata
• Model reduction of switched affine systems
• Proving the Correctness of the Implementation of a Control-Command Algorithm
• Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
• Optimal semicomputable approximations to reachable and invariant sets
• On Timed Models of Gene Networks
• On checking equivalence of simulation scripts
• A hybrid automata model of social networking addiction
• Interoperability of Performance and Functional Analysis for Electronic System Designs in Behavioural Hybrid Process Calculus (BHPC)
• On Timed Simulation Relations for Hybrid Systems and Compositionality
• Lie symmetries applied to interval integration
• Counterexample-Guided Refinement of Template Polyhedra

This page was built for software: PHAVer