SAT-BASED MODEL CHECKING FOR REGION AUTOMATA

DOI10.1142/S0129054106004108zbMATH Open1098.68082OpenAlexW2099766830MaRDI QIDQ5484902FDOQ5484902

Bow-Yaw Wang, Fang Yu

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

model checkingsatisfiabilityreal-time systemformal verificationregion automata

Mathematics Subject Classification ID

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

Cites Work

• Uppaal in a nutshell
• A theory of timed automata

Cited In (2)

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

   Recommendations

• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems 👍 👎
• Automated Technology for Verification and Analysis 👍 👎
• SAT-Based Model Checking 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• SAT-based unbounded model checking of timed automata 👍 👎
• Regular model checking revisited 👍 👎
• Bounded model checking using satisfiability solving 👍 👎

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)