Symbolic verification and test generation for a network of communicating FSMs
DOI10.1007/978-3-642-24372-1_32zbMATH Open1348.68140OpenAlexW1532940766MaRDI QIDQ3172932FDOQ3172932
Xiao-Qing Jin, Tae-Hyong Kim, Gianfranco Ciardo, Yang Zhao
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_32
Recommendations
- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems
- A framework for compositional nonblocking verification of extended finite-state machines
- Symbolic model checking: \(10^{20}\) states and beyond
- Canonical finite state machines for distributed systems
- Automatic verification of finite-state concurrent systems using temporal logic specifications
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This page was built for publication: Symbolic verification and test generation for a network of communicating FSMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172932)
