Publication:4736610

Publication date: 9 August 2004

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

68Q45: Formal languages and automata

93C30: Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)

Related Items

Unnamed Item, Approximated Reachability on Hybrid Automata: Falsification meets Certification, Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system, Model checking learning agent systems using Promela with embedded C code and abstraction, Qualitative fault tolerance analysis for a class of hybrid systems, 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, From control law diagrams to Ada via \textsf{Circus}, Hybridization methods for the analysis of nonlinear systems, Hybrid automata, reachability, and systems biology, Computing reachable sets for uncertain nonlinear monotone systems, Inclusion dynamics hybrid automata, 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, Polynomial interrupt timed automata: verification and expressiveness, Proving Approximate Implementations for Probabilistic I/O Automata, Template-Based Unbounded Time Verification of Affine Hybrid Automata, Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata, Property Driven Three-Valued Model Checking on Hybrid Automata

Uses Software