Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00236-018-0311-3 | Acta Inf. |
Field | DocType | Volume |
Computation tree logic,Discrete mathematics,Model checking,Fuzzy logic,Theoretical computer science,Compact space,Fuzzy control system,Formalism (philosophy),Rotation formalisms in three dimensions,Mathematics,Formal verification | Journal | 56 |
Issue | ISSN | Citations |
1 | 1432-0525 | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masoud Ebrahimi | 1 | 2 | 2.06 |
| Gholamreza Sotudeh | 2 | 3 | 0.73 |
| A. Movaghar | 3 | 197 | 32.28 |