Symbolic checking of Fuzzy CTL on Fuzzy Program Graph

Masoud Ebrahimi, Gholamreza Sotudeh, Ali Movaghar

Research output: Contribution to journalArticlepeer-review


Few fuzzy temporal logics and modeling formalisms are developed such that their model checking is both effective and efficient. State-space explosion makes model checking of fuzzy temporal logics inefficient. That is because either the modeling formalism itself is not compact, or the verification approach requires an exponentially larger yet intermediate representation of the modeling formalism. To exemplify, Fuzzy Program Graph (FzPG) is a very compact, and powerful formalism to model fuzzy systems; yet, it is required to be translated into an equal Fuzzy Kripke model with an exponential blow-up should it be formally verified. In this paper, we introduce Fuzzy Computation Tree Logic (FzCTL) and its direct symbolic model checking over FzPG that avoids the aforementioned state-space explosion. Considering compactness and readability of FzPG along with expressiveness of FzCTL, we believe the proposed method is applicable in real-world scenarios. Finally, we study formal verification of fuzzy flip-flops to demonstrate capabilities of the proposed method.
Original languageEnglish
JournalActa informatica
Publication statusE-pub ahead of print - 3 Feb 2018


Dive into the research topics of 'Symbolic checking of Fuzzy CTL on Fuzzy Program Graph'. Together they form a unique fingerprint.

Cite this