SAT-BASED MODEL CHECKING FOR REGION AUTOMATA

DOI10.1142/S0129054106004108MaRDI QIDQ5484902zbMATH OpenOpenAlexFDO

Authors Fang Yu, Bow-Yaw Wang

Publication date 21 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054106004108

zbMATH Keywords

formal verificationmodel checkingreal-time systemregion automatasatisfiability

Mathematics Subject Classification ID

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

Recommendations

• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Automated Technology for Verification and Analysis
• SAT-Based Model Checking
• scientific article; zbMATH DE number 4056983
• scientific article; zbMATH DE number 1670796
• scientific article; zbMATH DE number 2064232
• SAT-based unbounded model checking of timed automata
• Regular model checking revisited
• Bounded model checking using satisfiability solving

Cites work

• A theory of timed automata
• Uppaal in a nutshell

Cited in

(2)

• Automated Technology for Verification and Analysis
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

This page was built for publication: SAT-BASED MODEL CHECKING FOR REGION AUTOMATA

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