Using finite state machines as design and engineering model for database backed Web applications

EPVD: An interactive protocol specification and validation environment in Estelle formal specification

In this paper, a video-oriented Differential Energy Watermarking scheme based on Finite State Machine (FSM) model against time-space tampering is suggested, which not only retains classical DEW algorithm's advantages dealing with space-domain attack, but also efficiently detects time-domain synchronous attack by using FSM model to produce inter-frame correlation. It is compound algorithm against time-space tampering. Experiments show that the watermarks keep robust to common intra-frame disturbance such as noise while its fragility to malicious inter-frame attack provides it effective directivity against synchronous attack. In addition, it performs well in invisibility, algorithm security and complexity.

Nowadays, Vending Machines are well known among Japan, Malaysia and\nSingapore. The quantity of machines in these countries is on the top worldwide.\nThis is due to the modern lifestyles which require fast food processing with\nhigh quality. This paper describes the designing of multi select machine using\nFinite State Machine Model with Auto-Billing Features. Finite State Machine\n(FSM) modelling is the most crucial part in developing proposed model as this\nreduces the hardware. In this paper the process of four state (user Selection,\nWaiting for money insertion, product delivery and servicing) has been modelled\nusing MEALY Machine Model. The proposed model is tested using Spartan 3\ndevelopment board and its performance is compared with CMOS based machine.\n

Syllable segmentation is an important process in the development of realistic visual speech synthesis for the Indonesian language. The process is to determine the syllables in a text by applying certain rules. In this study, we develop a rule-based syllable segmentation to convert Indonesian text into syllables. The rules are represented in the form of a finite state machine (FSM). The FSM model depends on the combination of vowels and consonants. The syllable peak indicated by the sound of a vowel, while the consonant sound represents a syllable valley. In a syllable, there is only a syllable peak, but the syllable valley can be more than one. Therefore, the number of syllables can be determined by looking at the vowels present in a word. The rules can be formulated by looking at the syllable pattern. The pattern can only be a vowel sound, a vowel with a consonant sound, and a vowel with two consonant sounds and others. The evaluation is done by entering Indonesian texts to the FSM model. The result shows that the FSM model could determine the syllables properly.

Until now, simulation has been the primary approach for the functional verification of register transfer level (RTL) circuit descriptions written in a hardware description language (HDL). A finite state machine (FSM) coverage test can find all the bugs in a FSM design. However, this is impractical for large designs because of the state explosion problem. In this paper, we modify the higher-level FSM models used in other applications to replace the FSM model in the FSM coverage test. The state transition graphs (STGs) can be significantly reduced in this model, so that the complexity of the test becomes acceptable even for large designs. This model can be easily extracted from the original HDL code automatically, with little computation overhead. Experimental results show that it is indeed a promising functional test for FSMs.

Model-Based Testing (MBT) is a well-known technique that employs formal models to represent reactive systems’ behavior and generates test cases. Such systems have been specified and verified using mostly Finite State Machines (FSMs). There is a plethora of test generation algorithms in the literature; most of them are based on graphs once an FSM can be formally defined as a graph. Nevertheless, there is a lack of studies on analyzing cost and efficiency of FSM-based test generation algorithms. This study compares graph-based algorithms adopted to generate test cases from FSM models. In particular, we compare the Chinese Postman Problem (CPP) and H-Switch Cover (HSC) algorithms with the well-known Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms in the context of covering all-transitions and all-transition-pairs criteria in an FSM. First, a systematic literature mapping was conducted to summarize the methods that have been adopted in MBT, considering FSMs. Second, the main methods found were implemented and analyzed on randomly-generated FSMs, as well as real-world models that represent embedded systems of space applications. To make comparisons, we considered analyses in terms of cost (time), efficiency (mutant analysis) and characteristics of the generated test suites (number of test cases, average length of test cases, largest and smallest test cases, standard deviation and distribution of test cases). In general, CPP presented the best results in terms of number of test cases and test suite size. In addition, CPP also presented low distribution of average length compared to other algorithms.

Context: Model-Based Testing (MBT) is a technique that employs formal models to represent reactive systems’ behav-ior and generates test cases. Such systems are mostly specified and verified using Finite State Machines (FSMs). There is a plethora of test generation algorithms in the literature. Most of them are graph-based once an FSM can be formally defined as a graph. Nevertheless, there is a lack of studies on analyzing cost and efficiency of FSM-based test generation algorithms. Objective: This study aims to compare graph-based algorithms employed to generate test cases from FSM models. In particular, we compare the Chinese Postman Problem (CPP) and H-Switch Cover (HSC) algorithms with the well-known depth-first and breadth-first searches algorithms in the context of covering all-transitions and all-transition-pairs criteria in an FSM. Method: First, a systematic literature mapping was conducted to summarize the algorithms that have been adopted in MBT, considering FSM. The main algorithms found were implemented and analyzed in different experiments. Results: CPP presented better results with the FSMs used in terms of number of test cases and test suite size. In addition, CPP also presented low distribution of average length compared to other algorithms.

In this paper we consider one of the classical finite state machine (FSM) model modifications FSM with time-outs (or timed FSM). In this model in addition to the ordinary transitions under inputs there are transitions under time-outs when no input is applying. The behavior of many modern systems includes time-outs, for example, mobile phones, etc. In the past few years some work have been carried out on studying different relations between timed FSMs. Non-separability relation is very attractive for non-deterministic classical FSMs and FSMs with time-outs course for this relation we don’t need «all weather conditions» while testing. In this paper we present and compare two approaches for building a separating sequence for two separable FSMs with time-outs. One of them is using a conversion to classical FSMs, while another one is dealing directly with timed FSMs.

The goal of this paper was the development of a visual monitoring system for the management of stacking crane (moving within the aisles of the warehouse) using finite state machine (FSM). As usual, the implementation of a monitoring system required four preliminary steps: development of plotting FSM model, design of data exchange protocol, procession of operational monitoring data, visualization of a monitoring system. The paper was also presented form above contents. First, the operating characteristics of stacking cranes were analyzed to gain the operation control information and establish the plotting FSM model. Second, the data exchange protocol between the monitoring computer (MC) and the programmable logic controller (PLC) of stacking crane were designed based on the FSM model. Three, through the monitoring program, the operational data of stacking crane were gained and displayed in the visual monitoring platform. Finally, the visual monitoring system of stacking crane had been realized.

With the development of power industry, communication security has become an important issue affecting the stability of power system. IEC 62351 standard provides security for substation communication system. However, different transmission protocols may lead to different manufacturers to produce different understanding, manufacturing is not compatible with the device. In order to avoid such a situation, the Finite State Machine (FSM) theory is used to model and analyze the transmission protocol of IEC 62351 standard. In this paper, the FSM model is simulated by the StateFlow tool, and it can be considered that the FSM theory is applicable to the analysis of compliance with IEC 62351 standard.

The paper addresses a modified version of the CTW (context tree weighting) which deals with some FSM (finite state machine) models as well as the FSMX (FSM X) models at little expense of computing in encoding/decoding.

Due to the continuous advancements in wireless communication in terms of quality of communication and affordability of the technology, the application area of Mobile Adhoc Networks (MANETs) significantly growing particularly in military and disaster management. Considering the sensitivity of the application areas, security in terms of detection of Denial of Service (DoS) and intrusion has become prime concern in research and development in the area. The security systems suggested in the past has state recognition problem where the system is not able to accurately identify the actual state of the network nodes due to the absence of clear definition of states of the nodes. In this context, this paper proposes a framework based on Finite State Machine (FSM) for denial of service and intrusion detection in MANETs. In particular, an Interruption Detection system for Adhoc On-demand Distance Vector (ID-AODV) protocol is presented based on finite state machine. The packet dropping and sequence number attacks are closely investigated and detection systems for both types of attacks are designed. The major functional modules of ID-AODV includes network monitoring system, finite state machine and attack detection model. Simulations are carried out in network simulator NS-2 to evaluate the performance of the proposed framework. A comparative evaluation of the performance is also performed with the state-of-the-art techniques: RIDAN and AODV. The performance evaluations attest the benefits of proposed framework in terms of providing better security for denial of service and intrusion detection attacks.

The Edu-game “I love Maratua” was built through multimedia stages to introduce Bajau language learning to children. Matching type game, where players have to match pictures and words in the Bajau language. This study applies a randomization technique to the arrangement of pictures and words in each round to make the game no less challenging. We also apply randomization and probability to intelligent agents who accompany children to play in the form of little characters in Dayak traditional clothes. Intelligent agents applying the Finite State Machine (FSM) model will give happy, sad and so on expressions according to the child are playing style. The existence of randomness and probability in the FSM model makes the agent sometimes also give random expressions. This makes the agent more natural.KeywordsEdu-gameBajauRandomizationProbabilityFinite State MachineGame Agent

Nowadays more fuzz testing research mainly focuses on some certain phase and on some certain protocol, there is not an research on integrated system realization has been emerged. This paper presents the idea of an automated fuzz testing method for all protocols. First it adopted Finite State Machine (FSM) model in fuzz testing, and after a FSM constructed an efficient algorithm is presented for state space reduction. Last it selected every sequence for the mutation test. In this method, the FSM is created by program other than manual work that make the fuzz testing automated and suit for all protocols.

This paper presents an approach for verifying and validating time-dependent protocols, i.e. protocols for which the time spent for the functions is critical to a successful execution. The proposed approach is a novel modification of the traditional Unique Input/Output (UIO) method by explicitly taking into account the time specification of each edge in a protocol modeled as a finite state machine (FSM). A new FSM model which characterizes the timing properties of the protocol, is proposed. An algorithm which generates a test sequence with minimal traversal time for a time-dependent protocol in polynomial time complexity, is proposed.