PHAVer
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation
- Don't care words with an application to the automata-based approach for real addition
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Computing differential invariants of hybrid systems as fixed points
- Differential dynamic logic for hybrid systems
- Apron
- IMITATOR
- QEPCAD
- MoDeST
- HySAT
- MARCO
- KeYmaera
- HyTech
- SMV
- RSOLVER
- Benchmarks
- Time-triggered conversion of guards for reachability analysis of hybrid automata
- Uppaal
- Bellerophon: tactical theorem proving for hybrid systems
- Formal verification and quantitative metrics of MPSoC data dynamics
- ARMC
- Aspic
- HYSDEL
- PPL
- A hybrid automata model of social networking addiction
- MATISSE
- ToolboxLS
- Ariadne
- mctau
- HSolver
- Optimal and robust controller synthesis using energy timed automata with uncertainty
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
- On checking equivalence of simulation scripts
- RunLim
- On the efficiency of convex polyhedra
- MathSAT
- Lie symmetries applied to interval integration
- AutoMOTGen
- HI-maude
- PolyLib
- Refinements of behavioural abstractions for the supervisory control of hybrid systems
- ATL
- PPLite: zero-overhead encoding of NNC polyhedra
- d/dt
- LinAIG
- A compositional modelling and analysis framework for stochastic hybrid systems
- Ellipsoidal Toolbox
- HARE
- SpaceEx
- pyHybrid Analysis
- RAMAS
- Syntax and consistent equation semantics of hybrid Chi
- HSPICE
- BACH
- HyDI
- IBEX
- UPPAAL TIGA
- Hybrid abstractions of affine systems
- PAGAI
- Numerically-aided deductive safety proof for a powertrain control system
- Rapture
- Almost ASAP semantics: from timed models to timed implementations
- Finite data-rate feedback stabilization of switched and hybrid linear systems
- Optimal semicomputable approximations to reachable and invariant sets
- Modelling and analysing neural networks using a hybrid process algebra
- Hybrid automata as a modelling approach in the behavioural sciences
- Reachability analysis of linear systems with stepwise constant inputs
- Efficient constraint/generator removal from double description of polyhedra
- SPHIN: a model checker for reconfigurable hybrid systems based on SPIN
- Towards an efficient path-oriented tool for bounded reachability analysis of linear hybrid systems using linear programming
- Relating hybrid chi to other formalisms
- Model-based engineering of embedded systems using the hybrid process algebra Chi
- Reachability analysis of non-linear planar autonomous systems
- Hybrid automata-based CEGAR for rectangular hybrid systems
- Reachable set computation for uncertain time-varying linear systems
- Reachability games for linear hybrid systems
- Lyapunov abstractions for inevitability of hybrid systems
- HYST: a source transformation and translation tool for hybrid automaton models
- On reachability for hybrid automata over bounded time
- Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
- STRONG
- SPHIN
- Charon
- R-Charon
- Diagnosability of delay-deadline failures in fair real time discrete event models
- Statistical Model Checking for Networks of Priced Timed Automata
- Crossing the Bridge between Similar Games
- Composing stability proofs for hybrid systems
- Efficient bounded reachability computation for rectangular automata
- Parametric verification and test coverage for hybrid automata using the inverse method
- Verification of Hybrid Systems
- Symbolic model checking in non-Boolean domains
- HYST
- HyCreate
- C2e2
- LySHA
- ProbReach
- HySon
- Flow*
This page was built for software: PHAVer
