scientific article; zbMATH DE number 2242595

zbMath1087.68571MaRDI QIDQ5714448

Martin Fränzle

Publication date: 2 January 2006

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hybrid systemsDecidabilityProgress propertiesState recurrenceVerification procedures

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A survey of timed automata for the development of real-time systems, Quantifier-free encoding of invariants for hybrid systems, Taylor approximation for hybrid systems, Safety verification of non-linear hybrid systems is quasi-decidable, Monotonic hybrid systems, Quasi-decidability of a fragment of the first-order theory of real numbers, Property Driven Three-Valued Model Checking on Hybrid Automata, Approximated Reachability on Hybrid Automata: Falsification meets Certification, Continuity and computability of reachable sets, Approximate equivalence of the hybrid automata with Taylor theory