Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata A and B is a forward bisimulation if and only if its kernel and co-kernel are forward bisimulation fuzzy equivalence relations on A and B and there is a special isomorphism between factor fuzzy automata with respect to these fuzzy equivalence relations. As a consequence we get that fuzzy automata A and B are UFB-equivalent, i.e., there is a uniform forward bisimulation between them, if and only if there is a special isomorphism between the factor fuzzy automata of A and B with respect to their greatest forward bisimulation fuzzy equivalence relations. This result reduces the problem of testing UFB-equivalence to the problem of testing isomorphism of fuzzy automata, which is closely related to the well-known graph isomorphism problem. We prove some similar results for backward-forward bisimulations, and we point to fundamental differences. Because of the duality with the studied concepts, backward and forward-backward bisimulations are not considered separately. Finally, we give a comprehensive overview of various concepts on deterministic, nondeterministic, fuzzy, and weighted automata, which are related to bisimulations.

[1]  Jean-Marc Champarnaud,et al.  NFA reduction algorithms by means of regular inequalities , 2004, Theor. Comput. Sci..

[2]  W. Wechler.  The concept of fuzziness in automata and language theory , 1978 .

[3]  F. Klawonn.  Fuzzy points, fuzzy relations and fuzzy functions , 2000 .

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Grzegorz Rozenberg,et al.  Theory Is Forever , 2004, Lecture Notes in Computer Science.

[6]  Eugene S. Santos,et al.  Maximin Automata , 1968, Inf. Control..

[7]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[8]  Lucian Ilie,et al.  Reducing NFAs by invariant equivalences , 2003, Theor. Comput. Sci..

[9]  John N. Mordeson,et al.  Products of fuzzy finite state machines , 1997, Fuzzy Sets Syst..

[10]  Sung Jin Cho,et al.  Decompositions of T-generalized transformation semigroups , 2001, Fuzzy Sets Syst..

[11]  Witold Pedrycz,et al.  Minimization of lattice finite automata and its application to the decomposition of lattice languages , 2007, Fuzzy Sets Syst..

[12]  Miroslav Ciric,et al.  Fuzzy equivalence relations and their equivalence classes , 2007, Fuzzy Sets Syst..

[13]  Manfred Droste,et al.  Weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[14]  Cristian S. Calude,et al.  Finite nondeterministic automata: Simulation and minimality , 2000, Theor. Comput. Sci..

[15]  Tatjana Petkovic,et al.  Congruences and homomorphisms of fuzzy automata , 2006, Fuzzy Sets Syst..

[16]  Andreas Maletti,et al.  Backward and Forward Bisimulation Minimisation of Tree Automata , 2007, CIAA.

[17]  Miroslav Ciric,et al.  Reduction of fuzzy automata by means of fuzzy quasi-orders , 2011, Inf. Sci..

[18]  Agostino Dovier,et al.  An efficient algorithm for computing bisimulation equivalence , 2004, Theor. Comput. Sci..

[19]  Jacques Sakarovitch,et al.  On the equivalence of Z-automata , 2005 .

[20]  Raymond T. Yeh,et al.  On Relational Homomorphisms of Automata , 1968, Inf. Control..

[21]  N. C. Basak,et al.  On quotient machines of a fuzzy automaton and the minimal machine , 2002, Fuzzy Sets Syst..

[22]  Manfred Droste,et al.  Determinization of weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[23]  Davide Sangiorgi,et al.  On the origins of bisimulation and coinduction , 2009, TOPL.

[24]  Jacques Sakarovitch,et al.  Conjugacy and Equivalence of Weighted Automata and Functional Transducers , 2006, CSR.

[25]  Miroslav Ciric,et al.  Fuzzy homomorphisms of algebras , 2009, Fuzzy Sets Syst..

[26]  Hongyan Xing,et al.  Automata theory based on complete residuated lattice-valued logic , 2007, Science in China Series : Information Sciences.

[27]  Yongming Li,et al.  Minimization of states in automata theory based on finite lattice-ordered monoids , 2007, Inf. Sci..

[28]  Miroslav Ciric,et al.  Formal power series and regular operations on fuzzy languages , 2010, Inf. Sci..

[29]  Mustafa Demirci,et al.  A theory of vague lattices based on many-valued equivalence relations - I: general representation results , 2005, Fuzzy Sets Syst..

[30]  Francesco Ranzato,et al.  Generalizing the Paige-Tarjan algorithm by abstract interpretation , 2008, Inf. Comput..

[31]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[32]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[33]  Roberto Solis-Oba,et al.  Reducing the Size of NFAs by Using Equivalences and Preorders , 2005, CPM.

[34]  Z. Ésik,et al.  Iteration Theories: The Equational Logic of Iterative Processes , 1993 .

[35]  Eunjin Kim,et al.  Generalized morphisms, a new tool for comparative evaluation of performance of fuzzy implications, t-norms and co-norms in relational knowledge elicitation , 2001, Fuzzy Sets Syst..

[36]  Orna Kupferman,et al.  Lattice Automata , 2007, VMCAI.

[37]  Ulrich Höhle,et al.  Non-classical logics and their applications to fuzzy subsets : a handbook of the mathematical foundations of fuzzy set theory , 1995 .

[38]  J. Mordeson,et al.  Fuzzy Automata and Languages: Theory and Applications , 2002 .

[39]  Radim Belohlávek,et al.  Determinism and fuzzy automata , 2002, Inf. Sci..

[40]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[41]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[42]  Feng Lin,et al.  Modeling and control of fuzzy discrete event systems , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[43]  Madan M. Gupta,et al.  Fuzzy automata and decision processes , 1977 .

[44]  Qiu Daowen,et al.  Automata theory based on complete residuated lattice-valued logic , 2001 .

[45]  Miroslav Ciric,et al.  On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations , 2010, Fuzzy Sets Syst..

[46]  Wei Cheng,et al.  Minimization algorithm of fuzzy finite automata , 2004, Fuzzy Sets Syst..

[47]  Miroslav Ciric,et al.  Factorization of Fuzzy Automata , 2007, FCT.

[48]  Mustafa Demirci,et al.  Fuzzy Functions and Their Applications , 2000 .

[49]  Andreas Maletti,et al.  Backward and forward bisimulation minimization of tree automata , 2009, Theor. Comput. Sci..

[50]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1996, Inf. Comput..

[51]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[52]  Jean-Éric Pin,et al.  Syntactic Semigroups , 1997, Handbook of Formal Languages.

[53]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[54]  Yordan Kyosev,et al.  Fuzzy Relational Calculus - Theory, Applications and Software , 2004, Advances in Fuzzy Systems - Applications and Theory.

[55]  Eugene S. Santos.  Fuzzy automata and languages , 1976, Inf. Sci..

[56]  Sylvain Lombardy.  On the Construction of Reversible Automata for Reversible Languages , 2002, ICALP.

[57]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[58]  Yongming Li,et al.  Finite automata theory with membership values in lattices , 2011, Inf. Sci..

[59]  H. V. Kumbhojkar,et al.  On covering of products of fuzzy finite state machines , 2002, Fuzzy Sets Syst..

[60]  Michal Walicki,et al.  Categories of relational structures , 1997, WADT.

[61]  Luca Aceto,et al.  Reactive Systems: Modelling, Specification and Verification , 2007 .

[62]  George J. Klir,et al.  Fuzzy sets and fuzzy logic - theory and applications , 1995 .

[63]  Lucian Ilie,et al.  On NFA Reductions , 2004, Theory Is Forever.

[64]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[65]  W. Wee.  On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification , 1967 .

[66]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[67]  Eugene S. Santos,et al.  Max-product machines , 1972 .

[68]  Mustafa Demirci.  Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part II: vague algebraic notions , 2003, Int. J. Gen. Syst..

[69]  Daowen Qiu,et al.  Pumping lemma in automata theory based on complete residuated lattice-valued logic: A note , 2006, Fuzzy Sets Syst..

[70]  John N. Mordeson,et al.  Minimization of Fuzzy Finite Automata , 1999, Inf. Sci..

[71]  Stavros Konstantinidis,et al.  Fuzzification of Rational and Recognizable Sets , 2007, Fundam. Informaticae.

[72]  Tatjana Petkovic,et al.  Fuzzy relation equations and reduction of fuzzy automata , 2010, J. Comput. Syst. Sci..

[73]  Sung Jin Cho,et al.  Products of T-generalized state machines and T-generalized transformation semigroups , 1998, Fuzzy Sets Syst..

[74]  Zoltán Ésik,et al.  Simulation vs. Equivalence , 2010, FCS.

[75]  Siegfried Gottwald,et al.  Fuzzy Sets and Fuzzy Logic , 1993 .

[76]  Lucian Ilie,et al.  Algorithms for Computing Small NFAs , 2002, MFCS.

[77]  Carla Piazza,et al.  From Bisimulation to Simulation: Coarsest Partition Problems , 2003, Journal of Automated Reasoning.

[78]  Peter Buchholz,et al.  Bisimulation relations for weighted automata , 2008, Theor. Comput. Sci..

[79]  Manfred Droste,et al.  Weighted automata and multi-valued logics over arbitrary bounded lattices , 2012, Theor. Comput. Sci..

[80]  Zoltán Ésik,et al.  A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets , 2001, Words, Semigroups, and Transductions.

[81]  Nancy A. Lynch,et al.  Forward and Backward Simulations: I. Untimed Systems , 1995, Inf. Comput..

[82]  Miroslav Ciric,et al.  Uniform fuzzy relations and fuzzy functions , 2009, Fuzzy Sets Syst..

[83]  King-Sun Fu,et al.  A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems , 1969, IEEE Trans. Syst. Sci. Cybern..

[84]  Jacques Sakarovitch,et al.  Derivatives of rational expressions with multiplicity , 2005, Theor. Comput. Sci..

[85]  Hongyan Xing,et al.  Automata theory based on complete residuated lattice-valued logic: Pushdown automata , 2009, Fuzzy Sets Syst..

[86]  Dimitar P. Filev,et al.  Fuzzy SETS AND FUZZY LOGIC , 1996 .

[87]  Miroslav Ciric,et al.  Myhill-Nerode type theory for fuzzy languages and automata , 2010, Fuzzy Sets Syst..

[88]  Witold Pedrycz,et al.  Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids , 2005, Fuzzy Sets Syst..

[89]  Daowen Qiu,et al.  A note on Trillas' CHC models , 2007, Artif. Intell..

[90]  Ladislav J. Kohout,et al.  ON THE GENERAL THEORY OF RELATIONALMORPHISMS , 1986 .

[91]  Markus Roggenbach,et al.  Towards a unified view of bisimulation: a comparative study , 2000, Theor. Comput. Sci..

[92]  Fuchun Liu,et al.  Fuzzy Discrete-Event Systems Under Fuzzy Observability and a Test Algorithm , 2006, IEEE Transactions on Fuzzy Systems.

[93]  Lihua Wu,et al.  Automata theory based on complete residuated lattice-valued logic: Reduction and minimization , 2010, Fuzzy Sets Syst..

[94]  R. T. Yeh,et al.  Toward an Algebraic Theory of Fuzzy Relational Systems , 1973 .

[95]  Dominique Perrin,et al.  On the generating sequences of regular languages on k symbols , 2003, JACM.

[96]  邱道文.  Automata theory based on complete residuated lattice—valued logic（II） , 2001 .

[97]  Jan J. M. M. Rutten,et al.  Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.

[98]  C.J.H. Mann,et al.  Fuzzy Relational Systems: Foundations and Principles , 2003 .

[99]  Zhihui Li,et al.  The relationships among several types of fuzzy automata , 2006, Inf. Sci..

[100]  Manfred Droste,et al.  Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices , 2010, Developments in Language Theory.

[101]  Vilém Vychodil,et al.  Fuzzy equational logic , 2005, Arch. Math. Log..

[102]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[103]  Daowen Qiu,et al.  Characterizations of fuzzy finite automata , 2004, Fuzzy Sets Syst..

[104]  Lotfi A. Zadeh,et al.  Note on fuzzy languages , 1969, Inf. Sci..

[105]  Thomas Brihaye,et al.  Words and Bisimulations of Dynamical Systems , 2007, Discret. Math. Theor. Comput. Sci..

[106]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[107]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[108]  Berndt Farwer,et al.  ω-automata , 2002 .

[109]  Zorana Jancic,et al.  An improved algorithm for determinization of weighted and fuzzy automata , 2011, Inf. Sci..

[110]  Miroslav Ciric,et al.  Determinization of fuzzy automata with membership values in complete residuated lattices , 2008, Inf. Sci..

[111]  Hongyan Xing,et al.  Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic , 2009, Fuzzy Sets Syst..

[112]  Ping Li,et al.  Algebraic properties of LA-languages , 2006, Inf. Sci..

[113]  Ketty Peeva,et al.  Finite 𝕃-Fuzzy Acceptors, Regular 𝕃-Fuzzy Grammars And Syntactic Pattern Recognition , 2004, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[114]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[115]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[116]  Gunther Schmidt.  Homomorphism and Isomorphism Theorems Generalized from a Relational Perspective , 2006, RelMiCS.

[117]  Daowen Qiu,et al.  Supervisory control of fuzzy discrete event systems: a formal approach , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[118]  Daowen Qiu,et al.  Equivalence in automata theory based on complete residuated lattice-valued logic , 2007, Fuzzy Sets Syst..

[119]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[120]  F. Vaandrager.  Forward and Backward Simulations Part I : Untimed Systems , 1993 .

[121]  K. Peeva,et al.  Computing behavior of finite fuzzy machines - Algorithm and its application to reduction and minimization , 2008, Inf. Sci..