Minimal Determinization Algorithm for Fuzzy Automata

The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decision-making systems, and model checking, when a suitable model o...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on fuzzy systems Ročník 31; číslo 11; s. 1 - 10
Hlavní autori:	Grau, Aitor G. de Mendivil, Stanimirovic, Stefan, Farina, Federico
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Automata Automata theory Brzozowski's procedure complete deterministic fuzzy automaton Discrete event systems Equivalence factorization of fuzzy states Fault diagnosis Fuzzy finite automata Fuzzy systems Lattices locally finite lattices Mathematical models minimal determinization method Model checking Monitoring Nickel
ISSN:	1063-6706, 1941-0034
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decision-making systems, and model checking, when a suitable model of a fuzzy automaton is employed, it is desirable to find its language-equivalent deterministic version because of its computational efficiency. Although many methods have been developed to convert a fuzzy automaton to its language equivalent fuzzy deterministic finite automaton (FDfA), they can be applied only for fuzzy automata defined over specific underlying sets of truth values. For example, recently developed determinization methods employ the concept of maximal factorization, which can be defined only on non-locally finite lattices or the Boolean lattice. In addition, not all such determinization methods result in a minimal FDfA. On the other hand, even though such determinization methods have been developed for fuzzy automata over specific underlying structures, these methods cannot be generalized for fuzzy automata over locally finite lattices. This article focuses on filling this gap and develops a novel method for computing a minimal FDfA for a fuzzy automaton defined over a locally finite and divisible residuated lattice. Our method uses the new concept of a reduction graph that emerges from the strict order relation on the resulting fuzzy states, according to which we can construct all minimal FDfAs equivalent to a given fuzzy automaton.
AbstractList	The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decision-making systems, and model checking, when a suitable model of a fuzzy automaton is employed, it is desirable to find its language-equivalent deterministic version because of its computational efficiency. Although many methods have been developed to convert a fuzzy automaton to its language equivalent fuzzy deterministic finite automaton (FDfA), they can be applied only for fuzzy automata defined over specific underlying sets of truth values. For example, recently developed determinization methods employ the concept of maximal factorization, which can be defined only on non-locally finite lattices or the Boolean lattice. In addition, not all such determinization methods result in a minimal FDfA. On the other hand, even though such determinization methods have been developed for fuzzy automata over specific underlying structures, these methods cannot be generalized for fuzzy automata over locally finite lattices. This article focuses on filling this gap and develops a novel method for computing a minimal FDfA for a fuzzy automaton defined over a locally finite and divisible residuated lattice. Our method uses the new concept of a reduction graph that emerges from the strict order relation on the resulting fuzzy states, according to which we can construct all minimal FDfAs equivalent to a given fuzzy automaton. The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decision-making systems, and model checking, when a suitable model of a fuzzy automaton is employed, it is desirable to find its language-equivalent deterministic version because of its computational efficiency. Although many methods have been developed to convert a fuzzy automaton to its language equivalent fuzzy deterministic finite automaton (FDfA), they can be applied only for fuzzy automata defined over specific underlying sets of truth values. For example, recently developed determinization methods employ the concept of maximal factorization, which can be defined only on nonlocally finite lattices or the Boolean lattice. In addition, not all such determinization methods result in a minimal FDfA. On the other hand, even though such determinization methods have been developed for fuzzy automata over specific underlying structures, these methods cannot be generalized for fuzzy automata over locally finite lattices. This article focuses on filling this gap and develops a novel method for computing a minimal FDfA for a fuzzy automaton defined over a locally finite and divisible residuated lattice. Our method uses the new concept of a reduction graph that emerges from the strict order relation on the resulting fuzzy states, according to which we can construct all minimal FDfAs equivalent to a given fuzzy automaton.
Author	Grau, Aitor G. de Mendivil Farina, Federico Stanimirovic, Stefan
Author_xml	– sequence: 1 givenname: Aitor G. de Mendivil orcidid: 0000-0001-8961-8736 surname: Grau fullname: Grau, Aitor G. de Mendivil organization: Departamento de Estadística, Informática y Matemáticas, Universidad Pública de Navarra, Pamplona, Spain – sequence: 2 givenname: Stefan orcidid: 0000-0003-3126-1265 surname: Stanimirovic fullname: Stanimirovic, Stefan organization: University of Niš, Faculty of Sciences and Mathematics, Višegradska 33, Niš, Serbia – sequence: 3 givenname: Federico surname: Farina fullname: Farina, Federico organization: Departamento de Estadística, Informática y Matemáticas, Universidad Pública de Navarra, Pamplona, Spain
BookMark	eNp9kDtPwzAUhS1UJNrCH0AMkZhT7o0fccaqUEAqYmmXLpaTuuAqiYvjDO2vb_oYEAPTfeice3W-AenVrjaE3COMECF7mk8Xy-UogYSOaCIkA3FF-pgxjAEo63U9CBqLFMQNGTTNBgAZR9kn7MPWttJl9GyC8VU37HWwro7G5ZfzNnxX0dr5aNru97to3AZX6aBvyfVal425u9QhWUxf5pO3ePb5-j4Zz-KCMghxkWsOORaM5VoKwCznWqy4XrFMMiMKyFYCNdMZpAnFbpsK5EJKagqR08TQIXk8391699OaJqiNa33dvVSJlExmXKSsUyVnVeFd03izVlvfRfI7haCOdNSJjjrSURc6nUn-MRU2nJIHr235v_XhbLXGmF-_EDhHSg_FqHPl
CODEN	IEFSEV
CitedBy_id	crossref_primary_10_1016_j_fss_2024_109051 crossref_primary_10_1016_j_fss_2024_109108 crossref_primary_10_1142_S1793005725500528 crossref_primary_10_1007_s41870_025_02644_4 crossref_primary_10_1016_j_fss_2024_108990
Cites_doi	10.1109/TFUZZ.2015.2404348 10.1016/j.fss.2014.02.021 10.1016/j.fss.2017.09.004 10.1360/02yf9038 10.1145/2631915 10.1016/S0020-0255(02)00192-5 10.1016/j.ins.2010.12.008 10.1109/TFUZZ.2014.2310466 10.1016/j.ins.2014.06.033 10.1007/BF02713945 10.1016/j.fss.2019.03.009 10.1007/978-3-540-70844-5_17 10.1016/j.ins.2007.08.003 10.4236/jcc.2017.510003 10.1016/j.fss.2015.12.011 10.1007/978-3-642-01492-5_12 10.1016/j.ins.2009.01.015 10.1109/TFUZZ.2020.2988848 10.1016/j.fss.2009.06.007 10.1016/j.fss.2015.09.012 10.1016/j.ins.2018.08.033 10.1109/TFUZZ.2008.924212 10.1016/j.fss.2005.04.004 10.1016/j.artint.2006.12.002 10.1109/TSMCB.2004.840457 10.1109/TFUZZ.2014.2315620 10.1016/j.ins.2009.11.030 10.1016/j.fss.2009.08.005 10.1109/TFUZZ.2017.2775601 10.1016/j.fss.2019.07.006
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID	97E RIA RIE AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1109/TFUZZ.2023.3268406
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1941-0034
EndPage	10
ExternalDocumentID	10_1109_TFUZZ_2023_3268406 10105513
Genre	orig-research
GroupedDBID	-~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS HZ~ IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RNS TAE TN5 5VS AAYXX AETIX AGSQL AI. AIBXA ALLEH CITATION EJD H~9 ICLAB IFJZH VH1 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c340t-cba50b1c44ba86019b5a6d5ad4984e6c09d61a4a907231d4976156883ec6b32e3
IEDL.DBID	RIE
ISICitedReferencesCount	6
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001097110800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1063-6706
IngestDate	Sun Nov 30 03:51:08 EST 2025 Sat Nov 29 03:12:44 EST 2025 Tue Nov 18 22:18:26 EST 2025 Mon Aug 11 03:35:29 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	11
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c340t-cba50b1c44ba86019b5a6d5ad4984e6c09d61a4a907231d4976156883ec6b32e3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0003-3126-1265 0000-0001-8961-8736 0000-0002-9245-9710
OpenAccessLink	https://hdl.handle.net/2454/45642
PQID	2884895674
PQPubID	85428
PageCount	10
ParticipantIDs	ieee_primary_10105513 crossref_primary_10_1109_TFUZZ_2023_3268406 proquest_journals_2884895674 crossref_citationtrail_10_1109_TFUZZ_2023_3268406
PublicationCentury	2000
PublicationDate	2023-11-01
PublicationDateYYYYMMDD	2023-11-01
PublicationDate_xml	– month: 11 year: 2023 text: 2023-11-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on fuzzy systems
PublicationTitleAbbrev	TFUZZ
PublicationYear	2023
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref35 ref12 ref34 ref15 ref37 ref14 ref36 b?lohlávek (ref30) 2012 ref11 ref33 ref10 ref32 ref2 ref17 ref16 ref18 hopcroft (ref1) 2007 jan?i? (ref19) 2011; 181 jan?i? (ref21) 2014; 249 qiu (ref5) 2009; 17 stanimirovi? (ref25) 2019 mordeson (ref9) 2002 ref24 ref23 ref26 brzozowski (ref3) 0; 12 ref22 jan?i? (ref20) 2015; 301 ref28 ref27 ref29 ref8 ref7 ref4 ref6 b?lohlávek (ref31) 2005
References_xml	– ident: ref22 doi: 10.1109/TFUZZ.2015.2404348 – volume: 249 start-page: 73 year: 2014 ident: ref21 article-title: Brzozowski type determinization for fuzzy automata publication-title: Fuzzy Sets Syst doi: 10.1016/j.fss.2014.02.021 – ident: ref35 doi: 10.1016/j.fss.2017.09.004 – ident: ref15 doi: 10.1360/02yf9038 – ident: ref37 doi: 10.1145/2631915 – year: 2012 ident: ref30 publication-title: Fuzzy Relational Systems Foundations and Principles – year: 2019 ident: ref25 article-title: Improved algorithms for determinization of fuzzy and weighted automata publication-title: Fac Sci Math – ident: ref13 doi: 10.1016/S0020-0255(02)00192-5 – volume: 181 start-page: 1358 year: 2011 ident: ref19 article-title: An improved algorithm for determinization of weighted and fuzzy automata publication-title: Inf Sci doi: 10.1016/j.ins.2010.12.008 – ident: ref6 doi: 10.1109/TFUZZ.2014.2310466 – ident: ref23 doi: 10.1016/j.ins.2014.06.033 – ident: ref14 doi: 10.1007/BF02713945 – ident: ref29 doi: 10.1016/j.fss.2019.03.009 – year: 2007 ident: ref1 publication-title: Introduction to Automata Theory – ident: ref2 doi: 10.1007/978-3-540-70844-5_17 – ident: ref17 doi: 10.1016/j.ins.2007.08.003 – ident: ref11 doi: 10.4236/jcc.2017.510003 – volume: 301 start-page: 79 year: 2015 ident: ref20 article-title: Further improvements of determinization methods for fuzzy finite automata publication-title: Fuzzy Sets Syst – ident: ref12 doi: 10.1016/j.fss.2015.12.011 – ident: ref33 doi: 10.1007/978-3-642-01492-5_12 – ident: ref10 doi: 10.1016/j.ins.2009.01.015 – ident: ref8 doi: 10.1109/TFUZZ.2020.2988848 – ident: ref18 doi: 10.1016/j.fss.2009.06.007 – ident: ref36 doi: 10.1016/j.fss.2015.09.012 – ident: ref26 doi: 10.1016/j.ins.2018.08.033 – volume: 17 start-page: 578 year: 2009 ident: ref5 article-title: Fuzzy discrete-event systems under fuzzy observability and a test algorithm publication-title: IEEE Trans Fuzzy Syst doi: 10.1109/TFUZZ.2008.924212 – ident: ref16 doi: 10.1016/j.fss.2005.04.004 – ident: ref32 doi: 10.1016/j.artint.2006.12.002 – ident: ref4 doi: 10.1109/TSMCB.2004.840457 – ident: ref28 doi: 10.1109/TFUZZ.2014.2315620 – ident: ref34 doi: 10.1016/j.ins.2009.11.030 – year: 2005 ident: ref31 article-title: Fuzzy equational logic publication-title: Studies in Fuzziness and Soft Computing – ident: ref7 doi: 10.1016/j.fss.2009.08.005 – year: 2002 ident: ref9 publication-title: Fuzzy Automata and Languages Theory and Applications – volume: 12 start-page: 529 year: 0 ident: ref3 article-title: Canonical regular expressions and minimal state graphs for definite events publication-title: Proc Symp Math Theory Automata MRI Symposia Ser – ident: ref24 doi: 10.1109/TFUZZ.2017.2775601 – ident: ref27 doi: 10.1016/j.fss.2019.07.006
SSID	ssj0014518
Score	2.4738095
Snippet	The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	Algorithms Automata Automata theory Brzozowski's procedure complete deterministic fuzzy automaton Discrete event systems Equivalence factorization of fuzzy states Fault diagnosis Fuzzy finite automata Fuzzy systems Lattices locally finite lattices Mathematical models minimal determinization method Model checking Monitoring Nickel
Title	Minimal Determinization Algorithm for Fuzzy Automata
URI	https://ieeexplore.ieee.org/document/10105513 https://www.proquest.com/docview/2884895674
Volume	31
WOSCitedRecordID	wos001097110800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1941-0034 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014518 issn: 1063-6706 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA46POjB6Zw4ndKDN-lsmx9NjkMdHnR42GDsUtI008LWytYK7q83SdMxEQVvpeSV8F5f33vN-94HwDUX_oxKil3IuHARRIkbx8ogKhWB2JcqZlRzZp_C4ZBOJuzFgtUNFkZKaZrPZE9fmrP8JBel_lWmPFzTOWqO2t0wJBVYa3NkgLBf4d4IdEnokRoh47Hb0WA8nfY0UXgPmukm5FsUMrQqP77FJsAMmv_c2hE4tJmk069Mfwx2ZNYCzZqlwbFO2wIHWyMHTwB6TrN0oeTubR-MxWE6_flrvkyLt4Wj0lhnUK7Xn06_LHKV0fI2GA8eRnePrmVOcAVEXuGKmGMv9gVCMaeq5GIx5iTBPEGMIkmExxLic8RVZazyO3U3VIkNoRRKQWIYSHgKGlmeyTPg-IlmvtWNsAlDAcexKrECPbaeomDGGO4Av9ZkJOxYcc1uMY9MeeGxyGg_0tqPrPY74GYj814N1fhzdVvre2tlpeoO6NYWi6zjraJA7Yuqmi9E57-IXYB9_fQKT9gFjWJZykuwJz6KdLW8Mu_UF3yHxdw
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED9EBfXB6VScTu2Db9LZNh9LHodaFLfhwwTxpaRp1ME-ZOsE99ebpOmYiIJvpeRouOv17pr73Q_gXMjwhSlGfMSF9DHCmZ-m2iA6FUEkVDpmFHNm281ulz098QcHVrdYGKWUbT5TDXNpz_KzsZyZX2Xaww2do-GoXSMYR0EB11ocGmASFsg3inzaDGiJkQn4ZS9-fH5uGKrwBrLzTei3OGSJVX58jW2IiSv_3NwObLtc0msVxt-FFTWqQqXkafCc21Zha2no4B7gTn_UH2q5a9cJ45CYXmvwOp7087ehpxNZL57N559ea5aPdU4r9uExvuld3fqOO8GXCAe5L1NBgjSUGKeC6aKLp0TQjIgMc4YVlQHPaCiw0LWxzvD03aZObShjSEmaokihA1gdjUfqELwwM9y3phU24zgSJNVFVmQG1zMcvXBOahCWmkykGyxu-C0GiS0wAp5Y7SdG-4nTfg0uFjLvxViNP1fvG30vrSxUXYN6abHEud40ifS-mK76mvjoF7Ez2LjtddpJ-657fwyb5kkFurAOq_lkpk5gXX7k_enk1L5fX_XnySM
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Minimal+Determinization+Algorithm+for+Fuzzy+Automata&rft.jtitle=IEEE+transactions+on+fuzzy+systems&rft.au=Grau%2C+Aitor+G.+de+Mendivil&rft.au=Stanimirovic%2C+Stefan&rft.au=Farina%2C+Federico&rft.date=2023-11-01&rft.pub=IEEE&rft.issn=1063-6706&rft.spage=1&rft.epage=10&rft_id=info:doi/10.1109%2FTFUZZ.2023.3268406&rft.externalDocID=10105513
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6706&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6706&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6706&client=summon