Lazy Reachability Checking for Timed Automata with Discrete Variables

DOI10.1007/978-3-319-94111-0_14OpenAlexW2808006917MaRDI QIDQ5883582

István Majzik, Tamás Tóth

Publication date: 21 March 2023

Published in: Model Checking Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-94111-0_14

Mathematics Subject Classification ID

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

Related Items (2)

Configurable verification of timed automata with discrete variables ⋮ Efficient strategies for CEGAR-based model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Lazy reachability checking for timed automata using interpolants
• Difference Bound Constraint Abstraction for Timed Automata Reachability Checking
• Better Abstractions for Timed Automata
• Counterexample-guided abstraction refinement for symbolic model checking
• Automatic Abstraction Refinement for Timed Automata
• SMT-Based Induction Methods for Timed Systems
• Lazy abstraction
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Lazy Reachability Checking for Timed Automata with Discrete Variables