Trace abstraction refinement for timed automata

DOI10.1007/978-3-319-11936-6_28MaRDI QIDQ3457811zbMATH OpenOpenAlexFDO

Authors Weifeng Wang, Li Jiao

Publication date 17 December 2015

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11936-6_28

zbMATH Keywords

safetytimed automatatrace abstraction refinement

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1507209
• Verified model checking of timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Lazy reachability checking for timed automata using interpolants
• scientific article; zbMATH DE number 2102690

Cited in

(13)

• Symbolic timed trace equivalence
• Difference bound constraint abstraction for timed automata reachability checking
• On Abstractions for Timing Analysis in the $\mathbb{K}$ Framework
• Better abstractions for timed automata
• Automatic Abstraction Refinement for Timed Automata
• Trace-Based Semantics for Probabilistic Timed I/O 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
• Tools and Algorithms for the Construction and Analysis of Systems
• Abstraction refinement algorithms for timed automata
• Timed automata verification and synthesis via finite automata learning
• Timed automata verification and synthesis via finite automata learning

This page was built for publication: Trace abstraction refinement for timed automata

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