Automatic Abstraction Refinement for Timed Automata

DOI10.1007/978-3-540-75454-1_10MaRDI QIDQ3510839zbMATH OpenOpenAlexFDO

Authors Henning Dierks, Sebastian Kupferschmid, Kim G. 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automatic abstraction algorithm for timed automata
• Better abstractions for timed automata
• Better abstractions for timed automata
• Trace abstraction refinement for timed automata
• scientific article; zbMATH DE number 1796133
• Complete abstractions of dynamical systems by timed automata
• Lectures on Concurrency and Petri Nets
• A refinement-based process algebra for timed automata
• Difference bound constraint abstraction for timed automata reachability checking

Cited in

(23)

• Configurable verification of timed automata with discrete variables
• Randomized refinement checking of timed I/O automata
• 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
• Quantitative abstraction refinement
• Automatic abstraction algorithm for timed automata
• Better abstractions for timed automata
• An abstraction technique for real-time verification
• Stochastic games for verification of probabilistic timed automata
• scientific article; zbMATH DE number 1796133 (Why is no real title available?)
• Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
• Verification and parameter synthesis for real-time programs using refinement of trace abstraction
• Progress-preserving refinements of CTA
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Refinement of Timing Constraints for Concurrent Tasks with Scheduling
• Lazy Reachability Checking for Timed Automata with Discrete Variables
• Automated repair for timed systems
• Abstraction refinement algorithms for timed automata
• Stability analysis of planar probabilistic piecewise constant derivative systems
• An approximation-based incremental SMT approach for diagnosability analysis of real-time systems
• Counterfactual explanations for MITL violations
• Hybrid automata-based CEGAR for rectangular hybrid systems

Describes a project that uses

Uses Software

• CMC
• Uppaal

This page was built for publication: Automatic Abstraction Refinement for Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510839)