scientific article; zbMATH DE number 2085344

MaRDI QIDQ4736610zbMATH OpenFDO

Authors Gaurav Khanna, Ashish Tiwari

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2289/22890465.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Recommendations

• Abstractions for hybrid systems
• Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
• Abstractions of hybrid systems for verification
• The algorithmic analysis of hybrid systems
• Compositional abstractions of hybrid control systems

Cited in

(32)

• Pegasus: sound continuous invariant generation
• Unwinding biological systems
• Finite abstraction of mixed monotone systems with discrete and continuous inputs
• Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution
• Abstractions for hybrid systems
• Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system
• Polynomial interrupt timed automata: verification and expressiveness
• Proving approximate implementations for probabilistic I/O automata
• Template-based unbounded time verification of affine hybrid automata
• Model checking learning agent systems using Promela with embedded C code and abstraction
• Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata
• Property Driven Three-Valued Model Checking on Hybrid Automata
• Abstractions of hybrid systems for verification
• Approximated reachability on hybrid automata: falsification meets certification
• Finite bisimulations for dynamical systems with overlapping trajectories
• Facetal abstraction for non-linear dynamical systems based on δ-decidable SMT
• Computer Aided Verification
• Qualitative fault tolerance analysis for a class of hybrid systems
• Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
• Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
• CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
• Hybrid Systems: Computation and Control
• The minimum principle of hybrid optimal control theory
• From control law diagrams to Ada via \textsf{Circus}
• Pegasus: a framework for sound continuous invariant generation
• Cone-based abstract interpretation for nonlinear positive invariant synthesis
• Implicit semi-algebraic abstraction for polynomial dynamical systems
• Hybridization methods for the analysis of nonlinear systems
• Change-of-bases abstractions for non-linear hybrid systems
• Hybrid automata, reachability, and systems biology
• Computing reachable sets for uncertain nonlinear monotone systems
• Inclusion dynamics hybrid automata

Describes a project that uses

Uses Software

• SACLIB
• PVS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736610)