While testing based on finite state machines has been extensively investigated in the literature, issues concerning testing based on extended finite state machines (EFSMs) have not been adequately addressed. Such a testing is complicated due to the fact that a transition in an EFSM transforms a large (sometime infinite) set of data in contrast to just one value in a finite state machine. Moreov...

This paper presents a rigorous method for reconstructing events in digital systems. It is based on the idea, that once the system is described as a finite state machine, its state space can be explored to determine all possible scenarios of the incident. To formalize evidence, the evidential statement notation is introduced. It represents the facts conveyed by the evidence as a series of witnes...

In this article, we show the properties of the calculating type state machines. In the first section, we have defined calculating type state machines of which the state transition only depends on the first input. We have also proved theorems of the state machines. In the second section, we defined Moore machines with final states. We also introduced the concept of result of the Moore machines. ...

Kalman filtering has been widely considered for dynamic state estimation in smart grids. Despite its unique merits, the Kalman Filter (KF)-based dynamic state estimation can be undesirably influenced by cyber adversarial attacks that can potentially be launched against the communication links in the Cyber-Physical System (CPS). To enhance the security of KF-based state estimation, in this paper...

18 7.1 Some state machine theory. 7.2 The theoretical basis for finite state machine testing. 7.3 The theoretical basis for stream X-machine testing.

This paper proposes a revised semantic interpretation of UML Statechart Diagrams which ensures, under the specified design rules, that Statecharts may be constructed to have true compositional properties. In particular, hierarchical state machines may be properly encapsulated to allow independent verification and compositional testing, something which is not possible under the current UML seman...

As a generalization of a fuzzy finite state machine, the notion of a bipolar fuzzy finite state machine is introduced. Also, the concepts of a bipolar (immediate) successor, a bipolar exchange property and a bipolar subsystem are introduced. Some related properties are discussed. A condition for a bipolar fuzzy finite state machine to satisfy the bipolar exchange property is established. A char...

This article concerned with the translation of Quranic verses to Braille symbols, by using Visual basic program. The system has the ability to translate the special vibration for the Quran. This study limited for the (Noun + Scoon) vibrations. It builds on an existing translation system that combines a finite state machine with left and right context matching and a set of translation rules. Thi...

Automata learning is a known technique to infer a finite state machine from a set of observations. In this paper, we revisit Angluin’s original algorithm from a categorical perspective. This abstract view on the main ingredients of the algorithm lays a uniform framework to derive algorithms for other types of automata. We show a straightforward generalization to Moore and Mealy machines, which ...

We address the problem of selecting the minimum sized nite state machine consistent with given input/output samples. The problem can be solved by computing the minimum nite state machine equivalent to a nite state machine without loops obtained from the training set. We compare the performance of four algorithms for this task: two algorithms for incompletely speciied nite state machine reductio...