A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems

DOI10.1007/11812128_27zbMATH Open1160.68427OpenAlexW1507680901MaRDI QIDQ5757243FDOQ5757243

Authors: Suman Roy, Bhaskar Chakraborty 

Publication date: 6 September 2007

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11812128_27

Recommendations

• Symbolic model checking: \(10^{20}\) states and beyond
• Analysis of a class of communicating finite state machines
• scientific article; zbMATH DE number 1670791
• Automata theory and model checking
• Automated Technology for Verification and Analysis

Mathematics Subject Classification ID

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

Cited In (1)

• Symbolic verification and test generation for a network of communicating FSMs

This page was built for publication: A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems

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