A SAT-based technique to analyse networks of finite automata

zbMATH Open1212.68089MaRDI QIDQ3569852FDOQ3569852

Authors: Bożena Woźna, Andrzej Zbrzezny 

Publication date: 22 June 2010

Recommendations

• SAT-Based Analysis of Cellular Automata
• scientific article; zbMATH DE number 1629965
• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 2064232
• SAT-based reachability checking for timed automata with discrete data

zbMATH Keywords

SATfinite automatabounded model checkingECTL

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• SAT-Based Analysis of Cellular Automata
• Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

This page was built for publication: A SAT-based technique to analyse networks of finite automata

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