Difference bound constraint abstraction for timed automata reachability checking

DOI10.1007/978-3-319-19195-9_10MaRDI QIDQ2827453zbMATH OpenOpenAlexFDO

Authors Weifeng Wang, Li Jiao

Publication date 19 October 2016

Published in Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01767323/file/978-3-319-19195-9_10_Chapter.pdf

Mathematics Subject Classification ID

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Better abstractions for timed automata
• Better abstractions for timed automata
• Lazy reachability checking for timed automata using interpolants
• Trace abstraction refinement for timed automata

Cited in

(8)

• A quadratic-time DBM-based successor algorithm for checking timed automata
• Configurable verification of timed automata with discrete variables
• Better abstractions for timed automata
• Automatic Abstraction Refinement for Timed Automata
• scientific article; zbMATH DE number 1956585 (Why is no real title available?)
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 5033900 (Why is no real title available?)
• Lazy Reachability Checking for Timed Automata with Discrete Variables

This page was built for publication: Difference bound constraint abstraction for timed automata reachability checking

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