Skip to main content
SpringerLink
Log in
Book cover

National Conference of Theoretical Computer Science

NCTCS 2021: Theoretical Computer Science pp 75–88Cite as

Computation Tree Logic Model Checking over Possibilistic Decision Processes Under Finite-Memory Scheduler

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1494))

Abstract

Possibilistic model checking has been studied extensively, but the nondeterministic actions contained in the system are absent in previous possibilistic model checking. In order to add this nondeterminism to the model, we introduce the notion of generalized possibilistic decision processes (GPDP, in short) in this paper. We propose the scheduler to solve the nondeterminism of actions. We study the model checking under finite-memory scheduler, i.e., giving a GPDP, a finite-memory scheduler and a generalized possibilistic computation tree logic (GPoCTL) formula, compute its possibility under this scheduler. What’s more, a method based on Entropy-weight TOPSIS is given to select the optimal schedulers from all given schedulers over possibility and necessity measures.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT press, Cambridge (2008)

    Google Scholar 

  2. Cao, Y., Ying, M.: Observability and decentralized control of fuzzy discrete-event systems. IEEE Trans. Fuzzy Syst. 14(2), 202–216 (2006)

    Article  MathSciNet  Google Scholar 

  3. Clarke, E., Grumberg, O., Peled, D.: Model Checking. Massachusetts, London, UK, Cambridge (1999)

    MATH  Google Scholar 

  4. Deng, W., Qiu, D.: Bifuzzy discrete event systems and their supervisory control theory. IEEE Trans. Fuzzy Syst. 23(6), 2107–2121 (2015)

    Article  Google Scholar 

  5. Drakopoulos, J.A.: Probabilities, possibilities, and fuzzy sets. Fuzzy Sets Syst. 75(1), 1–15 (1995)

    Article  MathSciNet  Google Scholar 

  6. Dubois, D.: Possibility theory and statistical reasoning. Comput. Stat. Data Anal. 51(1), 47–69 (2006)

    Article  MathSciNet  Google Scholar 

  7. Dubois, D., Prade, H.: Possibility theory, probability theory and multiple-valued logics: a clarification. Ann. Math. Artif. Intell. 32(1–4), 35–66 (2001)

    Article  MathSciNet  Google Scholar 

  8. Dubois, D., Prade, H.: Possibility theory. Scholarpedia 2(10), 2074 (2007)

    Article  Google Scholar 

  9. Dubois, D., Prade, H.: Possibility theory and its applications: where do we stand? In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 31–60. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-43505-2_3

    Chapter  MATH  Google Scholar 

  10. Dubois, D., Dupin de Saint-Cyr, F., Prade, H.: Update postulates without inertia. In: Froidevaux, C., Kohlas, J. (eds.) ECSQARU 1995. LNCS, vol. 946, pp. 162–170. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60112-0_19

    Chapter  Google Scholar 

  11. Dubois, D., de Saintcyr, F.D., Prade, H.: Updating, transition constraints and possibilistic Markov chains. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds.) IPMU 1994. LNCS, vol. 945, pp. 261–272. Springer, Heidelberg (1995). https://doi.org/10.1007/BFb0035959

    Chapter  Google Scholar 

  12. Li, Y.: Quantitative model checking of linear-time properties based on generalized possibility measures. Fuzzy Sets Syst. 320, 17–39 (2017)

    Article  MathSciNet  Google Scholar 

  13. Li, Y., Lei, L., Li, S.: Computation tree logic model checking based on multi-valued possibility measures. Inf. Sci. 485, 87–113 (2019)

    Article  MathSciNet  Google Scholar 

  14. Li, Y., Li, L.: Model checking of linear-time properties based on possibility measure. IEEE Trans. Fuzzy Syst. 21(5), 842–854 (2013)

    Article  MathSciNet  Google Scholar 

  15. Li, Y., Li, Y., Ma, Z.: Computation tree logic model checking based on possibility measures. Fuzzy Sets Syst. 262, 44–59 (2015)

    Article  MathSciNet  Google Scholar 

  16. Li, Y., Ma, Z.: Quantitative computation tree logic model checking based on generalized possibility measures. IEEE Trans. Fuzzy Syst. 23(6), 2034–2047 (2015)

    Article  Google Scholar 

  17. Li, Y., Wei, J.: Possibilistic fuzzy linear temporal logic and its model checking. IEEE Trans. Fuzzy Syst. 29(7), 1899–1913 (2021)

    Article  Google Scholar 

  18. Lin, F., Ying, H.: Modeling and control of fuzzy discrete event systems. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 32(4), 408–415 (2002)

    Google Scholar 

  19. Pan, H., Li, Y., Cao, Y., Ma, Z.: Model checking fuzzy computation tree logic. Fuzzy Sets Syst. 262, 60–77 (2015)

    Article  MathSciNet  Google Scholar 

  20. Qiu, D.: Supervisory control of fuzzy discrete event systems: a formal approach. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 35(1), 72–88 (2005)

    Google Scholar 

  21. Yoon, K.P., Hwang, C.L.: Multiple Attribute Decision Making: An Introduction. Sage publications, Thousand Oaks (1995)

    Google Scholar 

  22. Zadeh, L.A.: Fuzzy sets. Inf. Control 8(3), 338–353 (1965)

    Article  Google Scholar 

  23. Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1(1), 3–28 (1978)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgment

This work was partially supported by National Science Foundation of China (Grant Nos: 12071271,11671244) and the Fundamental Research Funds For the Central Universities (Grant No: 2020CSLY016). Useful suggestions given by Junmei Wang, Dr. Na Chen and Dr. Xianfeng Yu are also acknowledged.

Author information

Authors and Affiliations

  1. School of Computer Science, Shaanxi Normal University, Xi’an, Shaanxi, China

    Wuniu Liu, Qing He & Yongming Li

Authors
  1. Wuniu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qing He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yongming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongming Li .

Editor information

Editors and Affiliations

  1. National University of Defense Technology, Changsha, China

    Zhiping Cai

  2. Tsinghua University, Beijing, China

    Jian Li

  3. Chinese Academy of Sciences, Beijing, China

    Jialin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, W., He, Q., Li, Y. (2021). Computation Tree Logic Model Checking over Possibilistic Decision Processes Under Finite-Memory Scheduler. In: Cai, Z., Li, J., Zhang, J. (eds) Theoretical Computer Science. NCTCS 2021. Communications in Computer and Information Science, vol 1494. Springer, Singapore. https://doi.org/10.1007/978-981-16-7443-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-7443-3_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-7442-6

  • Online ISBN: 978-981-16-7443-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation