Dynamically-Driven Timed Automaton Abstractions for Proving Liveness of Continuous Systems

DOI10.1007/978-3-642-33365-1_6zbMath1375.68072OpenAlexW185629625MaRDI QIDQ4649386

Rebekah Carter, Eva María Navarro-López

Publication date: 21 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33365-1_6

zbMATH Keywords

timed automataabstractioncontinuous-time systemsautomated verificationliveness properties

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Symbolic dynamics (37B10)

Related Items (1)

Deadness and how to disprove liveness in hybrid dynamical systems

This page was built for publication: Dynamically-Driven Timed Automaton Abstractions for Proving Liveness of Continuous Systems