Learning assumptions for compositional verification of timed automata

DOI10.1007/978-3-031-37706-8_3MaRDI QIDQ6535626zbMATH OpenFDO

Authors Hanyue Chen, Yu Su, Miaomiao Zhang, Zhiming Liu, Junri Mi

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-37706-8_3

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1956591
• Computer Aided Verification
• Automatic symbolic compositional verification by learning assumptions
• Compositional probabilistic verification through multi-objective model checking
• Compositional verification for timed systems based on automatic invariant generation

Cites work

• A theory of timed automata
• An efficient algorithm for learning event-recording automata
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Computer Aided Verification
• Event-clock automata: a determinizable class of timed automata
• Formal Methods for the Design of Real-Time Systems
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3926220 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• scientific article; zbMATH DE number 1956591 (Why is no real title available?)
• scientific article; zbMATH DE number 1746645 (Why is no real title available?)
• scientific article; zbMATH DE number 2102690 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Learning one-clock timed automata
• Learning regular sets from queries and counterexamples
• Model checking
• Optimized L*-Based Assume-Guarantee Reasoning
• Refining Interface Alphabets for Compositional Verification
• SAT-Based Compositional Verification Using Lazy Learning
• Three optimizations for assume-guarantee reasoning with \(L^{*}\)
• Timed automata verification and synthesis via finite automata learning
• Verifying abstractions of timed systems

This page was built for publication: Learning assumptions for compositional verification of timed automata

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