Automatic Abstraction Refinement for Timed Automata
From MaRDI portal
Publication:3510839
DOI10.1007/978-3-540-75454-1_10zbMath1141.68431OpenAlexW1514172519MaRDI QIDQ3510839
Henning Dierks, Sebastian Kupferschmid, Kim Guldstrand Larsen
Publication date: 3 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75454-1_10
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (12)
Configurable verification of timed automata with discrete variables ⋮ Refinement of Timing Constraints for Concurrent Tasks with Scheduling ⋮ Lazy Reachability Checking for Timed Automata with Discrete Variables ⋮ Abstraction based verification of stability of polyhedral switched systems ⋮ Extracting counterexamples induced by safety violation in linear hybrid systems ⋮ Hybrid automata-based CEGAR for rectangular hybrid systems ⋮ Automated repair for timed systems ⋮ Stability analysis of planar probabilistic piecewise constant derivative systems ⋮ Progress-preserving Refinements of CTA ⋮ Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security ⋮ Stochastic Games for Verification of Probabilistic Timed Automata ⋮ Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*
Uses Software
This page was built for publication: Automatic Abstraction Refinement for Timed Automata
