Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Symbolic checking of fuzzy CTL on fuzzy program graph
Ebrahimi M., Sotudeh G., Movaghar A. Acta Informatica56 (1):1-33,2019.Type:Article
Date Reviewed: Mar 20 2019

This paper presents a new temporal logic for fuzzy logic systems, fuzzy computation tree logic (FzCTL), based on previous work on Kripke structures for fuzzy logic systems, that is, fuzzy program graph (FzPG) [1]. The motivation for providing a new temporal logic is to reduce state explosion, which is worse in fuzzy systems than in regular model checking. This is achieved by using ordered binary decision diagram (OBDD) techniques to represent the FzPG Kripke structure and to effectively evaluate FzCTL temporal formulas.

The authors evaluate performance in different ways. I found the table comparing different maximum OBDD heights to be the most interesting. Their implementation is tested with a couple of useful examples, showing how the choice of fuzzy variables may have an important impact on determining model stability and on evaluating different temporal formulas.

My only concern is typographical errors; they may not stop the reader from understanding the content, but do prevent a fluid and enjoyable reading experience.

Reviewer:  Santiago Escobar Review #: CR146478 (1906-0239)
1) Sotudeh, G.; Movaghar, A. Abstraction and approximation in fuzzy temporal logics and models. Formal Aspects of Computing 27, 2(2015), 309–334.
Bookmark and Share
  Featured Reviewer  
 
Temporal Logic (F.4.1 ... )
 
 
Model Checking (D.2.4 ... )
 
 
Process Models (F.3.2 ... )
 
 
Uncertainty, “Fuzzy,” And Probabilistic Reasoning (I.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Temporal Logic": Date
On projective and separable properties
Peled D. Theoretical Computer Science 186(1-2): 135-156, 1997. Type: Article
Oct 1 1998
Temporal logics for real-time system specification
Bellini P., Mattolini R., Nesi P. ACM Computing Surveys 32(1): 12-42, 2000. Type: Article
Sep 1 2000
An expressively complete linear time temporal logic for Mazurkiewicz traces: an experiment with the shortest-paths algorithms
Thiagarajan P., Walukiewicz I. Information and Computation 179(2): 230-249, 2002. Type: Article
Jul 10 2003
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy