Automatic Abstraction Refinement for Timed Automata
From MaRDI portal
Publication:3510839
DOI10.1007/978-3-540-75454-1_10zbMath1141.68431MaRDI 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
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*, Progress-preserving Refinements of CTA, Refinement of Timing Constraints for Concurrent Tasks with Scheduling, Lazy Reachability Checking for Timed Automata with Discrete Variables, Automated repair for timed systems, Stability analysis of planar probabilistic piecewise constant derivative systems, Hybrid automata-based CEGAR for rectangular hybrid systems, Configurable verification of timed automata with discrete variables, Abstraction based verification of stability of polyhedral switched systems, Extracting counterexamples induced by safety violation in linear hybrid systems, Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security, Stochastic Games for Verification of Probabilistic Timed Automata
Uses Software