General Fuzzy Automata, New Efficient Acceptors for Fuzzy Languages

Doostfatemeh, M.; Kremer, Stefan C.

doi:10.1109/fuzzy.2006.1681991

Cited by 6 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Doostfatemeh and Kremer [1] therefore introduced a new general definition of fuzzy automation to establish a better basis for automation and the foundations for future applications. Furthermore, general fuzzy automata can also remove the burden of generating a deterministic acceptor to calculate membership values of the strings without developing a deterministic Moore automaton and it can also be used in large fuzzy grammars and languages [12]. In addition, this study takes into account the multi-member value of the General Fuzzy Switchboard Automata (GFSA), since it treats more than one membership value in a state.…”

Section: Literature Reviewmentioning

confidence: 99%

General Fuzzy Switchboard Transformation Semigroup

Nur Ain Ebas,

Kavikumar Jacob,

Mohd Saifullah Rusiman

et al. 2024

ARASET

View full text Add to dashboard Cite

Commutative and switching processing are central to computation. However, some problems arise when classical versions do not reflect the true needs of current computer science, whereby they cannot predict the flow of the next input information in the specified output. The Switchboard State Machine is a controller that controls the direct flow of information from one state to another and also plays the main part in communication between the subsystems. If the simple system satisfies the two properties of the switching and commutative state machines, the system is therefore a finite switchboard state machine. The general fuzzy switchboard automation (GFSA) was introduced by incorporating the switchboard into the general fuzzy automation. This paper is intended to introduce the concept of a general fuzzy switchboard transformation semigroup (GFSTS) by combining the GFSA and the transformation semigroup. Some related definitions and properties are established. The example of certain products, such as GFSTS cascade products, has also been studied. General Fuzzy Switchboard Poly-Transformation Semigroup (GFSPS) is also introduced since it fulfils the switchboard state machine properties. Some of the definitions and properties associated with the GFSPS are defined. Applications for general fuzzy switchboard automata, such as washing machines, are also provided.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

General Fuzzy Switchboard Transformation Semigroup

Nur Ain Ebas,

Kavikumar Jacob,

Mohd Saifullah Rusiman

et al. 2024

ARASET

View full text Add to dashboard Cite

show abstract

“…It has been used in the past to represent imprecise specifications (Mensch & Lipp, 1990) and to model learning systems (Wee & Fu, 1969). Fuzziness has been introduced in the different components of the automata: states, transitions, and actions (Doostfatemeh & Kremer, 2006;Mraz, Lapanja, Zimic, & Virant, 1999;Wee & Fu, 1969). Although there are many proposals to define fuzzy automata (Andrés, Llana, & Núñez, 2011;Doostfatemeh & Kremer, 2005;Mordeson & Malik, 2002;Wee & Fu, 1969), we considered timed automata because it is much easier to reuse its existing tools to deal with fuzzy time than build tools from scratch.…”

Section: Introductionmentioning

confidence: 99%

Analysis of temporal complex events in sensor networks

Boubeta-Puig

Bravetti

Llana

et al. 2017

Journal of Information and Telecommunication

View full text Add to dashboard Cite

In this paper we introduce a framework for detecting anomalies in the clocks of the different components of a network of sensor stations connected with a central server for measuring of air quality. Local clocks of sensor stations can be advanced/delayed with respect to the central server clock and this situation provokes the inaccuracy in the interpretation of the collected data. We propose a novel approach, supported by a formal representation of the network using fuzzy-timed automata, to precisely represent the expected behaviour of each component of the network. Using fuzzy logic concepts, we can specify admissible mismatches between the clocks. In addition, we apply complex event processing (CEP) technology in order to automatically detect situations of interest while processing the massive amount of data transferred across the network. Specifically, we have designed a collection of CEP patterns that trigger alarms when unexpected differences are observed. We also report the results obtained from the application of our approach to the network

show abstract

“…Fuzzy automata have been used to deal with different science fields: imprecise specifications [11], modeling Learning Systems [18] and many others. Fuzziness has been introduced in the different components of the automata: states, transitions, and actions [18,13,6]. A similar work of ours has been made in [7].…”

Section: Introductionmentioning

confidence: 99%

Fuzzy-Timed Automata

Crespo

Encina

Llana

2010

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Timed automata theory is well developed in literature. This theory provides a formal framework to model and test real-time systems. This formal framework supplies a way to describe transitions among states with timing constrains. These constraints are usually expressed with logic formulas involving the system clocks. The time domain of these clocks usually is considered dense, that is, the clocks take values in the real or rational numbers. Dealing with a domain like this can be hard, specially if we consider end points of intervals.In this paper, we present a modification of the model that allows to use real time in an easier, more powerful and reliable approach for computing systems. Our proposed model exploits the concepts of fuzzy set theory and related mathematical frameworks to get a more flexible approach.

show abstract

General Fuzzy Automata, New Efficient Acceptors for Fuzzy Languages

Cited by 6 publications

References 17 publications

General Fuzzy Switchboard Transformation Semigroup

General Fuzzy Switchboard Transformation Semigroup

Analysis of temporal complex events in sensor networks

Fuzzy-Timed Automata

Contact Info

Product

Resources

About