PHAVer

swMATH4123MaRDI QIDQ16309FDOQ16309

Author name not available (Why is that?)

Official website: http://www-verimag.imag.fr/~frehse/phaver_web/

Described by source

• Hybrid Systems: Computation and Control

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

• Reachability games for linear hybrid systems
• Efficient bounded reachability computation for rectangular automata
• Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction
• Rigorous simulation-based analysis of linear hybrid systems
• 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
• Formal Modeling and Analysis of Timed Systems
• Trajectory-based theory for hybrid systems
• Approximate simulation relations for hybrid systems
• Hybrid Systems: Computation and Control
• Fairness of transitions in diagnosability of discrete event systems
• Automating Verification of Cooperation, Control, and Design in Traffic Applications
• The structure of differential invariants and differential cut elimination
• 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
• 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)
• 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
• Model reduction of switched affine systems
• Hybridization methods for the analysis of nonlinear systems
• Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
• 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
• Almost ASAP semantics: from timed models to timed implementations
• On checking equivalence of simulation scripts
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Computing Differential Invariants of Hybrid Systems as Fixedpoints
• A hybrid automata model of social networking addiction
• Verification of Hybrid Systems
• 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
• 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
• Composing stability proofs for hybrid systems
• Bisimulation conversion and verification procedure for goal-based control systems
• Counterexample-Guided Refinement of Template Polyhedra
• Applications of MetiTarski in the Verification of Control and Hybrid Systems
• Approximating Continuous Systems by Timed Automata
• Time-triggered conversion of guards for reachability analysis of hybrid 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
• Robust Test Generation and Coverage for Hybrid Systems
• Composing reachability analyses of hybrid systems for safety and stability
• Verifying global start-up for a Möbius ring-oscillator
• Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming
• Optimal and robust controller synthesis using energy timed automata with uncertainty
• Symbolic model checking in non-Boolean domains
• Differential Dynamic Logic for Verifying Parametric Hybrid Systems
• Formal verification and quantitative metrics of MPSoC data dynamics
• Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking
• Symbolic Reachability Analysis of Lazy Linear Hybrid Automata
• 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
• Reachability computation for polynomial dynamical systems
• Safety verification for probabilistic hybrid systems
• d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
• On the efficiency of convex polyhedra
• Codac
• Proving the Correctness of the Implementation of a Control-Command Algorithm
• Optimal semicomputable approximations to reachable and invariant sets
• On Timed Models of Gene Networks
• Formal system verification. State-of the-art and future trends
• Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
• Interoperability of Performance and Functional Analysis for Electronic System Designs in Behavioural Hybrid Process Calculus (BHPC)
• An introduction to the verification of hybrid systems using \textsc{Ariadne}
• On Timed Simulation Relations for Hybrid Systems and Compositionality
• Lie symmetries applied to interval integration
• Parametric verification and test coverage for hybrid automata using the inverse method
• Verification and parameter synthesis for real-time programs using refinement of trace abstraction
• Automated Machine-Checked Hybrid System Safety Proofs
• An Algebraic Algorithm for the Identification of Glass Networks with Periodic Orbits Along Cyclic Attractors
• Numerically-aided deductive safety proof for a powertrain control system
• Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
• Reachability analysis of non-linear planar autonomous systems
• Refinements of behavioural abstractions for the supervisory control of hybrid systems
• Relating hybrid chi to other formalisms
• Non-convex invariants and urgency conditions on linear hybrid automata
• Formal Verification Applied to Robotic Surgery
• Modelling and analysing neural networks using a hybrid process algebra
• 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
• Constraints for Continuous Reachability in the Verification of Hybrid 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

This page was built for software: PHAVer