Yet Another Model Checker for PROMELA - The Transformation Approach

Automated verification plays vital roles on concurrent system design. PROMELA, as a popular system description language, has been widely used for this purpose. PROMELA models can be analyzed with the SPIN model checker, which is, however, deficient with respect to perform verification under strong fairness. In this work, we represent a translator that can translate PROMELA models into CSP# models automatically, which can be analyzed and be verified under strong fairness using PAT.