Fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata over distributive lattices

We give a new version of fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that $L$-fuzzy nondeterministic $\mathrm{B\ddot{u}chi}$ automata have the same expressive power as $L$-fuzzy alternating $\mathrm{B\ddot{u}chi}$ ones. A direct construction (without related knowledge about $L$-fuzzy nondeterministic $\mathrm{B\ddot{u}chi}$ ones such as: above equivalence relation and their closure properties) is given to show that the languages recognized by $L$-fuzzy alternating co-$\mathrm{B\ddot{u}chi}$ automata are also $L$-fuzzy $\omega$-regular. Furthermore, the closure properties and the discussion about decision problems for fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata are illustrated in our paper.

[1]  Orna Kupferman,et al.  Alternation Removal in Büchi Automata , 2010, ICALP.

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

[3]  Kamala Krithivasan,et al.  Fuzzy ω-automata , 2001 .

[4]  Yongming Li,et al.  Quantitative Computation Tree Logic Model Checking Based on Generalized Possibility Measures , 2014, IEEE Transactions on Fuzzy Systems.

[5]  Han Zhao Equivalent Characterizations of Fuzzy Büchi Automata , 2013 .

[6]  Orna Kupferman,et al.  Weak alternating automata are not that weak , 2001, TOCL.

[7]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[8]  Moshe Y. Vardi An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

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

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  Yongming Li Quantitative model checking of linear-time properties based on generalized possibility measures , 2017, Fuzzy Sets Syst..

[12]  Krishnendu Chatterjee,et al.  Alternating Weighted Automata , 2009, FCT.

[13]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

[14]  Brian A. Davey,et al.  Introduction to Lattices and Order: Frontmatter , 2002 .

[15]  Manfred Droste,et al.  On Weighted BÜchi Automata with Order-Complete Weights , 2007, Int. J. Algebra Comput..

[16]  Yongming Li,et al.  Model Checking of Linear-Time Properties Based on Possibility Measure , 2012, IEEE Transactions on Fuzzy Systems.

[17]  Orna Kupferman,et al.  Max and Sum Semantics for Alternating Weighted Automata , 2011, ATVA.