Advertisement

Bisimulation of type 2 for BL-general fuzzy automata

  • Marzieh Shamsizadeh
  • Mohammad Mehdi ZahediEmail author
Foundations
  • 15 Downloads

Abstract

In this note, first, we define bisimulation of type 2 for a basic logic general fuzzy automaton and show that if there exists a bisimulation of type 2 between two basic logic general fuzzy automata, then they have the same behavior. Also, by using the greatest bisimulation of type 2, we obtain a quotient basic logic general fuzzy automaton in which this quotient is minimal. Moreover, we prove that if there exists a bisimulation of type 1 between two automata, then there is a bisimulation of type 2 between them, but the converse is not valid. Moreover, we give an algorithm, which determines the bisimulation of type 2 between any two basic logic general fuzzy automata and show that the time complexity of this algorithm is so better than the time complexity of the algorithm computing bisimulation of type 1. After that, we present some examples to clarify the notions and results of this paper.

Keywords

BL-general fuzzy automata Bisimulation of type 2 Quotient automata Minimal automata 

Notes

Acknowledgements

The authors wish to thank Iran National Science Foundation (INSF) for financial support.

Compliance with ethical standards

Conflict of interest

None of the authors have a conflict of interest.

Ethical approval

This article does not contain any studies with human participants performed by any of the authors.

References

  1. Abolpour K, Zahedi MM (2012) Isomorphism between two BL-general fuzzy automata. Soft Comput 16:729–736CrossRefzbMATHGoogle Scholar
  2. Aceto L, Ingólfsdóttir A, Larsen KG, Srba J (2007) Reactive systems: modelling, specification and verification. Cambridge University Press, CambridgeCrossRefzbMATHGoogle Scholar
  3. Basak NC, Gupta A (2002) On quotient machines of a fuzzy automata and the minimal machine. Fuzzy Sets Syst 125:223–229CrossRefzbMATHGoogle Scholar
  4. Cassandras CG, Lafortune S (2009) Introduction to discrete event systems. Springer, BerlinzbMATHGoogle Scholar
  5. Cheng W, Mo ZW (2004) Minimization algorithm of fuzzy finite automata. Fuzzy Sets Syst 141:439–448MathSciNetCrossRefzbMATHGoogle Scholar
  6. Ćirić M, Ignjatović J, Damljanović N, Bašić M (2012a) Bisimulations for fuzzy automata. Fuzzy Sets Syst 186:100–139MathSciNetCrossRefzbMATHGoogle Scholar
  7. Ćirić M, Ignjatović J, Jančić I, Damljanović N (2012b) Computation of the greatest simulations and bisimulations between fuzzy automata. Fuzzy Sets Syst 208:22–42MathSciNetCrossRefzbMATHGoogle Scholar
  8. Ćirić M, Ignjatović J, Bašić M, Jančić I (2014) Nondeterministic automata: equivalence, bisimulations, and uniform relations. Inf Sci 261:185–218MathSciNetCrossRefzbMATHGoogle Scholar
  9. Doostfatemeh M, Kremer SC (2005) New directions in fuzzy automata. Int J Approx Reason 38:175–214MathSciNetCrossRefzbMATHGoogle Scholar
  10. Dovier A, Piazza C, Policriti A (2004) An efficient algorithm for computing bisimulation equivalence. Theor Comput Sci 311:221–256MathSciNetCrossRefzbMATHGoogle Scholar
  11. Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. SIAM Rev 24:90–91Google Scholar
  12. Hájek P (1998) Metamathematics of fuzzy logic, vol 4. Springer, BerlinzbMATHGoogle Scholar
  13. Lee ET, Zadeh LA (1969) Note on fuzzy languages. Inf Sci 4:421–434MathSciNetCrossRefGoogle Scholar
  14. Mateescu A, Salomaa A, Salomaa K, Yu S (1996) Lexical analysis with a simple finite fuzzy automaton model. J Univ Comput Sci 1:292–311MathSciNetCrossRefzbMATHGoogle Scholar
  15. Milner R (1980) A calculus of communicating systems. In: Goos G, Hartmanis J (eds) Lecture notes in computer science, vol 92. Springer, BerlinGoogle Scholar
  16. Park D (1981) Concurrency and automata on infinite sequences. Theor Comput Sci 104:167–183CrossRefGoogle Scholar
  17. Peeva K (1988) Behavior, reduction and minimization of finite L-automata. Fuzzy Sets Syst 28:171–181CrossRefzbMATHGoogle Scholar
  18. Peeva K (1991) Equivalence, reduction and minimization of finite automata over semirings. Theor Comput Sci 88:269–285MathSciNetCrossRefzbMATHGoogle Scholar
  19. Nguyen HT, Elbert A, Walker A (2005) First course in fuzzy logic. CRC Press, Boca RatonzbMATHGoogle Scholar
  20. Ray AK, Chatterjee B, Majumdar AK (1991) A formal power series approach to the construction of minimal fuzzy automata. Inf Sci 55:189–207MathSciNetCrossRefzbMATHGoogle Scholar
  21. Roggenbach M, Majster-Cederbaum M (2000) Towards a unified view of bisimulation: a comparative study. Theor Comput Sci 238:81–130MathSciNetCrossRefzbMATHGoogle Scholar
  22. Saeidi Rashkolia A, Shamsizadeh M (2018) Transformation of BL-general fuzzy automata. Int J Ind Math (in press) Google Scholar
  23. Santos ES (1968) Maximin automata. Inf Control 13:363–377MathSciNetCrossRefzbMATHGoogle Scholar
  24. Shamsizadeh M, Zahedi MM (2015a) Intuitionistic general fuzzy automata. Soft Comput 20:3505–3519CrossRefzbMATHGoogle Scholar
  25. Shamsizadeh M, Zahedi MM (2015b) Minimal intutionistic general L-fuzzy automata. Ital J Pure Appl Math 35:155–186zbMATHGoogle Scholar
  26. Shamsizadeh M, Zahedi MM (2016) Minimal and statewise minimal intuitionistic general L-fuzzy automata. Iran J Fuzzy Syst 23:131–152Google Scholar
  27. Shamsizadeh M, Zahedi MM, Abolpour K (2016) Bisimulation for BL-general fuzzy automata. Iran J Fuzzy Syst 13:35–50MathSciNetzbMATHGoogle Scholar
  28. Shamsizadeh M, Zahedi MM, Abolpour K (2018) Admissible partition for BL-general fuzzy automaton. Iran J Fuzzy Syst 17:79–90zbMATHGoogle Scholar
  29. Skiena SS (1998) The algorithm design manual, vol 1. Springer, BerlinzbMATHGoogle Scholar
  30. Topencharov V, Peeva K (1981) Equivalence, reduction and minimization of finite fuzzy automata. J Math Anal Appl 84:270–281MathSciNetCrossRefzbMATHGoogle Scholar
  31. Turunen E (2001) Boolean deductive systems of BL-algebras. Arch Math Log 40:467–473MathSciNetCrossRefzbMATHGoogle Scholar
  32. Wee WG (1967) On generalization of adaptive algorithm and application of the fuzzy sets concept to pattern classification. Ph.D. thesis, Purdue University, Lafayette, INGoogle Scholar
  33. Zadeh LA (1965) Fuzzy sets. Inf Control 8:338–353CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of MathematicsGraduate University of Advanced TechnologyKermanIran

Personalised recommendations