Behavioral Equivalence between General Fuzzy Automata: A Functorial and BL-Algebraic Approach

Document Type : Original Manuscript

Authors
Marzieh Shamsizadeh 1
Khadijeh Abolpour 2
1 Department of Mathematics and Statistics, Faculty of Energy and Data Sciences, Behbahan Khatam Alanbia University of Technology, Behbahan, Iran
2 Department of Mathematics, Shi.C., Islamic Azad University, Shiraz, Iran
10.22034/mmr.2026.131041.0
Abstract
In this paper, a categorical framework is proposed for modeling and analyzing the behavior of general fuzzy automata based on BL-algebras. First, a category of BL general fuzzy automata is defined, in which morphisms act as fuzzy mappings between fuzzy state sets and reconstruct the initial, transition, and output structures in a compositional manner. Then, functors from the category of nondeterministic automata to this category are introduced, which model the fuzzy behavior of systems via fuzzy transition and output mappings. To compare the behavior of these functors, the notion of behavioral equivalence is defined based on a residuated operator in the BL lattice, and a set of fuzzy equivalent mappings between functors is introduced. It is proven that this set, if nonempty, contains a maximal element that reconstructs behavioral structures in a fuzzy manner. Furthermore, based on the concept of bisimulation between nondeterministic automata, it is shown that this relation is transferred under the behavioral functor to a fuzzy bisimulation between BL general fuzzy automata. Based on this transfer, it is proven that the existence of a bisimulation between nondeterministic automata guarantees behavioral equivalence between the resulting BL general fuzzy automata.
Keywords
Behavioral Equivalence
General Fuzzy Automata
Nondeterministic Automata
Bisimulation
Categories
Subjects
[1] K. Abolpour, M. M. Zahedi, Isomorphism between two BL-general fuzzy automata, Soft Computing, 16 (2012), 729-736.
[2] P. Buchholz, Bisimulation relations for weighted automata, Theoretical Computer Science, 393 (2008), 109-123.
[3] M. Ćirić, J. Ignjatović, M. Bašić, I. Jančić, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Information Sciences, 261 (2013), 185-218.
[4] M. Ćirić, J. Ignjatović, N. Damljanović, M. Bašić, Bisimulations for fuzzy automata, Fuzzy Sets and Systems, 186 (2012), 100-139.
[5] M. Doostfatemeh, S. C. Kremer, New directions in fuzzy automata, International Journal of Approximate Reasoning, 38.2 (2005), 175-214.
[6] M. Eder, Monoids, automata and related constructions in monoidal categories, PhD diss, 2015.
[7] M. R. Gary, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, (1979).
[8] P. Hájek, Metamathematics of Fuzzy Logic, Trends in Logic, vol. 4, Kluwer, Dordercht, 1998.
[9] Z. Jančić, I. Micić, M. Ćirić, J. R. G. de Mendívil, S. Stanimirović, Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations, Fuzzy Sets and Systems, (2025), 109625.
[10] R. Kaur, A. Tripathi, Hybrid model of general fuzzy automata and semantic computing: an application to transportation e-service, Soft Computing, 28 (2024), 10519-10530.
[11] F. R. Lima-Junior, Advances in Fuzzy Logic and Artificial Neural Networks, Mathematics 12 (2024), 3949.
[12] I. Micić, M. Ćirić, J. Matejić, S. Stanimirović, L. A. Nguyen, Approximate weak simulations and bisimulations for fuzzy automata over the product structure, Fuzzy Sets and Systems, 485 (2024), 108959.
[13] R. Milner, Acalculus of communicating systems, in: G. Goos, J. Hartmanis (Eds.), Lecture Notes in Computer Science, Springer, 92 (1980).
[14] D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proceedings of the 5th GI Conference, Karlsruhe, Germany, Lecture Notes in Computer Science, Springer-Verlag, 104, (1981), 167-183.
[15] J. Pavelka, On fuzzy logic i, ii, iii, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25 (1979), 447-464.
[16] M. Shamsizadeh, M. M. Zahedi, Kh. Abolpour, Admissible Partition for BL-general fuzzy automata, Iranian Journal of Fuzzy Systems, 15 (2018), 79-90.
[17] M. Shamsizadeh, M. M. Zahedi, Bisimulation of type 2 for BL-general fuzzy automata, Soft Computing, 23 (2019), 9843-9852.
[18] M. Shamsizadeh, M. M. Zahedi, Kh. Abolpour, Bisimulation for BL-general fuzzy automata, Iranian Journal of Fuzzy Systems (2016).
[19] S. S. Skiena, The algorithm design manual: Text. Vol. 1. Springer Science & Business Media, 1998.
[20] S. Stanimirović, L. A. Nguyen, M. Ćirić, M. Stanković, Breadth-first fuzzy bisimulations for fuzzy automata, Fuzzy Sets and Systems, 503 (2025), 109246.
[21] S. Yu, Regular languages, in: G. Rozenberg, A. Salomaa (Eds.), Hand book of Formal Languages, vol. 1, Springer-Verlag, Berlin, Heidelberg, 1997, 41–105.
[22] L. A. Zadeh, Fuzzy sets, Information and control, 8 (1965), 338-353.