scientific article; zbMATH DE number 2085344
From MaRDI portal
Publication:4736610
zbMath1044.93523MaRDI QIDQ4736610
Gaurav Khanna, Ashish Kumar Tiwari
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2289/22890465.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (23)
Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system ⋮ Template-Based Unbounded Time Verification of Affine Hybrid Automata ⋮ Finite abstraction of mixed monotone systems with discrete and continuous inputs ⋮ Pegasus: sound continuous invariant generation ⋮ Model checking learning agent systems using Promela with embedded C code and abstraction ⋮ Hybridization methods for the analysis of nonlinear systems ⋮ Polynomial interrupt timed automata: verification and expressiveness ⋮ Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution ⋮ The minimum principle of hybrid optimal control theory ⋮ Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata ⋮ From control law diagrams to Ada via \textsf{Circus} ⋮ Abstractions for hybrid systems ⋮ Qualitative fault tolerance analysis for a class of hybrid systems ⋮ Hybrid automata, reachability, and systems biology ⋮ 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 ⋮ Unnamed Item ⋮ Computing reachable sets for uncertain nonlinear monotone systems ⋮ Inclusion dynamics hybrid automata ⋮ Property Driven Three-Valued Model Checking on Hybrid Automata ⋮ Approximated Reachability on Hybrid Automata: Falsification meets Certification ⋮ Proving Approximate Implementations for Probabilistic I/O Automata ⋮ Unwinding biological systems
Uses Software
This page was built for publication:
