Use Of Finite State Machines Research Articles

Maze Of Faith : The Perfect Pray

The development of the gaming industry demands developers to create more immersive playing experiences. In this context, the use of Finite State Machine (FSM) has become a popular and effective solution for managing storyline progression and structured character development. This article discusses the basic concepts of FSM and illustrates its implementation in the game "Maze of Faith: Perfect Prayer" as a means of education and entertainment. The application of FSM in this game aims to enhance gameplay dynamics and provide a clear structure to the player's journey. The article elaborates on the fundamental FSM concepts applied in the game, highlighting how FSM usage can improve the quality of the playing experience for gamers. Through an analysis of FSM implementation in this game, the article provides a deeper understanding of how the FSM framework can be utilized to control storyline progression, character behavior, and overall gameplay dynamics. The implementation of FSM in "Maze of Faith: Perfect Prayer" has a positive impact on creating a well-structured, dynamic, and relevant playing experience aligned with modern player expectations.

Dialog modeling of domain specific cognitive assistants

Intelligent virtual assistants of software are becoming more common. Frequently, the communication interface is dialogue which is expressed in natural language. When an assistant consists of questions that are associated with a single answer, the abstraction of the dialogue is straightforward, however, when there are conversations with multiple bifurcations in the flow of communication, the representation and documentation is complex. In this sense, there is a lack of formalities that allow a dialogue to be accurately represented and based on them, to proceed with its programming in an industrial framework. In this work we propose the use of finite state machines to model complex dialogues. Thus, we introduce a formal model for the representation of dialogue and its mapping to a real assistant, using an industrial framework. We believe that our approach will make it easier to design and to program assistants with complex interaction, enabling better adoption of them.

A Distributed Intrusion Detection System for AODV Network

Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol, designed for mobile ad hoc networks, offers quick adaptation to dynamic link conditions, low processing and memory overhead, and low network utilization. However, without keeping in mind the security issues in the protocol design, AODV is vulnerable to various kinds of attacks. This thesis analyzes some of the vulnerabilities, specifically discussing attacks against AODV that manipulate the routing messages. We propose a solution based on specification-based intrusion detection to detect attacks on AODV. Briefly, our approach involves the use of finite state machines for specifying correct AODV routing behavior and distributed network monitors for detecting run-time violation of the specifications. In addition, one additional field in the protocol message is proposed to enable the monitoring. We illustrate that our algorithm, which employs a tree data structure, can effectively detect most of the serious attacks in real time and with minimum overhead. Routing attacks will have distressing effects over the network and bequest a significant challenge once planning strong security mechanisms for vehicular communication. In this paper, we examine the effect and malicious activities of a number of the foremost common attacks and also mention some security schemes against some major attacks in VANET. The attacker's aim is only to modify the actual route or provides the false data about the route to the sender and also some attackers are only flooding unwanted packets to consume resources in available network. Various routing approaches are also mentioned in the paper because the routing of data is very important to deliver the traffic information to leading vehicles. It's advised that a number of the ways that to approach this made field of analysis issues in VANET might be to fastidiously design new secure routing protocols in which attacks are often rendered meaningless and because of the inherent constraints found in the network, there's a desire for light-weight and sturdy security mechanisms.

Experience of Implementation of the Protocol TLS 1.3 Verification

This paper presents the experience of verifying server implementations of the TLS cryptographic protocol version 1.3. TLS is a widely used cryptographic protocol designed to create secure data transmission channels and provides the necessary functionality for this: confidentiality of the transmitted data, data integrity, and authentication of the parties. The new version 1.3 of the TLS protocol was introduced in August 2018 and has a number of significant differences compared to the previous version 1.2. A number of TLS developers have already included support for the latest version in their implementations. These circumstances make it relevant to do research in the field of verification and security of the new TLS protocol implementations. We used a new test suite for verifying implementations of the TLS 1.3 for compliance with Internet specifications, developed on the basis of the RFC8446, using UniTESK technology and mutation testing methods. The current work is part of the TLS 1.3 protocol verification project and covers some of the additional functionality and optional protocol extensions. To test implementations for compliance with formal specifications, UniTESK technology is used, which provides testing automation tools based on the use of finite state machines. The states of the system under test define the states of the state machine, and the test effects are the transitions of this machine. When performing a transition, the specified impact is passed to the implementation under test, after which the implementation's reactions are recorded and a verdict is automatically made on the compliance of the observed behavior with the specification. Mutational testing methods are used to detect non-standard behavior of the system under test by transmitting incorrect data. Some changes are made to the protocol exchange flow created in accordance with the specification: either the values of the message fields formed on the basis of the developed protocol model are changed, or the order of messages in the exchange flow is changed. The protocol model allows one to make changes to the data flow at any stage of the network exchange, which allows the test scenario to pass through all the significant states of the protocol and in each such state to test the implementation in accordance with the specified program. So far, several implementations have been found to deviate from the specification. The presented approach has proven effective in several of our projects when testing network protocols, providing detection of various deviations from the specification and other errors.

Finite State Machine Modelling to Facilitate the Resilience of Infrastructures: Reflections

The ability of an infrastructure to be resistant against hazards or to accommodate and recover from hazard-induced destructions and disturbances is characterized as resilience. Usually, infrastructures are engineered socio-technical systems or systems-of-systems. Jackson and Ferris consider the use of finite state machine (FSM) modelling as a suitable means to depict and investigate the resilience of such engineered systems. This paper discusses the capabilities and limitations of the FSM model proposed by Jackson and Ferris and if it should be used for the representation and evaluation of the resilience of an infrastructure. The discussion is conducted on a more general level. However, special attention is paid to monitoring because, on the one hand, monitoring is one of the cornerstones of resilience and, on the other hand, Scott and Ferris define a state that is emphasized by an increased level of situational awareness as a result of happened and perceived events. Consequently, the question has to be answered of how the models are able to reflect the need for routine monitoring of the resilience of infrastructures in order to initiate, if necessary, adjustment procedures as an appropriate response to changes in internal and external conditions. The results of this theoretical study are a fundamental step towards the practical application of the FSM approach for the design of resilient infrastructures.

The Use of Finite State Machines in the Development Built-In Systems User Interface

The Use of Finite State Machines in the Development Built-In Systems User Interface

The Use of Finite State Machines in the Development of Software for Machines with Complex Structure

The Use of Finite State Machines in the Development of Software for Machines with Complex Structure

Learning from the computational modelling of Plains Cree verbs

This paper describes the ongoing process of creating a computational morphological model of Plains Cree, a language native to North America, making use of finite-state machines, and with a focus on verbs. We cover prior linguistic theoretical and descriptive models of Plains Cree, moving on to the computational implementation of (chiefly) inflectional phenomena, followed by relevant morphophonological processes. We evaluate the performance of our computational implementation with a hand-verified corpus of Plains Cree, and present a discussion of the morphological complexity found in the corpus, as compared to that of our model and its theoretical underpinnings. The results of this evaluation and research into natural language use inform us about the practical extent of morphological complexity for a polysynthetic language, and allow us to identify avenues for improvement of the model. Finally, this computational model for Plains Cree offers the opportunity to create various digital tools and applications for language users for the maintenance and revitalization of this language in the 21st century.

A Unified Parameterization of Human Gait Across Ambulation Modes.

This paper introduces a novel gait parameterization method that models gait kinematics as a continuous function of gait cycle phase, walking speed, and ground slope. Kinematic data was recorded from seven able-bodied subjects walking on a treadmill at twenty-seven combinations of walking speed and ground slope. Convex optimization was used to determine the parameters of a function of three variables that fits this experimental data. This function may be able to provide desired trajectories to a virtual constraint controller over a continuum of gait phases and ambulation modes. This could allow for a single, non-switching controller to control a prosthetic leg for a variety of tasks, avoiding many of the problems associated with the ubiquitous use of finite state machines in prosthesis control.

FSM Model of a Simple Photovoltaic System

The paper describes a simulation model of a simple photovoltaic system intended as a tool for testing the use of finite state machines for simulations representing a long-term operation of renewable energy sources. The mathematical model of the photovoltaic system is described first. Then it is used to build a finite state machine model that calculates a power output of the photovoltaic system for changing values of a solar irradiance and a temperature. Data measured on a real photovoltaic installation are used to verify model’s accuracy through its comparison with a previously created and verified Matlab model. The finite state machine model presented in this paper was created using Ptolemy II software.

A Validation Technique for UML Activity Model

In the current scenario of modeling, object-oriented modeling has completely replaced the structured modeling approach. Software industries are slowly-slowly shifting their old structured based softwares into the object-oriented based softwares, for e.g. Foxpro has been changed into the Visual Foxpro. From the literature, it is observed that various researchers are proposing the software models based on the object-oriented technology. It is a big challenge whether the proposed design is correct or reliable for a long time. For solution of this problem, the present work deals with a proposal of Unified Modeling Language (UML) model for a real case study of Mobile Bill Deposit System (MBDS) By the use of UML, class and activity models are designed for static and dynamic representation of the problem. For validation purpose the activity model is validated by the use of Finite State Machine (FSM) technique and results are presented in the form of test cases. When the size of the model becomes complex then presented technique shall help for validation of the complex model.

Improving channel capacity by nonlinearity compensation and noise suppression in high-speed multi-span optical transmission systems

In this paper, the channel capacity of 40Gb/s multi-span nonlinear optical transmission systems with nonlinearity compensation and self-adapting Wiener filtering is studied by use of Finite State Machine (FSM) approach. The comparison of channel capacity of the system with differential phase shift keying (DPSK) and on–off keying (OOK) modulation is also investigated. The channel capacity increases monotonically with the input power for transmission systems with simultaneous compensation of dispersion and nonlinearity, which performs as well as linear system. DPSK shows a much better performance and the channel capacity has an improvement of at least 48 percent over that OOK modulation. A further reduction of the amplified spontaneous emission (ASE) noise accumulation is obtained by Wiener filtering, which improves the channel capacity considerably when the input peak power is less than 3mW.

Modeling and Validation of Object-Oriented Test Case through Finite State Machine

Distributed computing approach is preferred over centralized approach due to low cost involvement and for providing reliability and expandability to network. An object-oriented language Unified Modeling Language is proposed by the authors to model the dynamic behavior for execution of tasks for the digital watch under distributed environment. A UML state diagram is designed and then converted into the transition diagram for computation of valid test cases by the use of Finite State Machine (FSM). Test cases are validated for the validation of the UML state diagram. The approach for generating the test cases through FSM is very reliable and efficient and does not support for the invalid test cases.

Validation of UML Class Model through Finite-State Machine

The Unified Modeling Language (UML) is an independent to programming language which has a collection of modeling tools through which software engineers and researcher represent the complex research problems in the diagrammatic form. The various tools represent the static as well as the dynamic behavior of an object-oriented software system. The state chart diagram is a well known tool of UML which shows the dynamic behavior of states of an object-oriented system. The entire life of an object is represented by this tool. The state transformation of an object is depending on the three major components like transition function, action and possible inputs. The paths through which an object changes its state are determined by the state chart diagrams. These paths can be represented in the graphical form with the use of Finite State Machine (FSM). The graphical representation is very useful for determining the correctness of the diagram. In the present work, an approach to validate the UML class model through FSM is described with a creation of the transition table. For testing purpose, some test cases are generated to test the correctness of UML state chart diagram by taking a real case study of Life Insurance Corporation (LIC) of India. An approach to verify the correctness of UML diagram is presented.

Finite State Machines: Preserving Privacy When Data-Mining Cellular Phone Networks

During the last several years, researchers have begun to gain access to telecommunications data from cellular-network operators. This development heralds a methodological revolution in fields with complex and extensive data needs and the combination of continuous monitoring and real-time response would enable us to deploy increasingly intelligent infrastructure. However, when used as a research tool, the personal nature of the cellular phone raises new ethical questions regarding the trade-off between personal privacy and the public good. To date, models for mobile privacy have emerged primarily from the field of GPS studies. This article proposes a new approach, the use of Finite State Machines (FSMs), as a technique that is particularly suited to the specific computational and technical constraints of the cellular network.

A framework for efficient development of Slovenian written language resources used in speech processing applications

This paper presents a framework for the efficient development and representation of morphological and phonetic lexicons, to be used in speech technology applications. Solutions that would be the most appropriate for developing speech technologies for specific language have to be analyzed when developing the lexicons. In the paper issues such as the development of resources, good word coverage in general texts, efficient coding of lexicons, representation (regarding time and memory space) and the integration of lexicons in speech processing applications are addressed. The construction process within the proposed framework is based on the use of finite-state machines and heterogeneous relation-graphs structures, and significantly reduces the time and effort needed for the construction of large-scale lexica, minimizes any analysis errors, and efficiently represents the lexicons, regarding time and memory usage. The wordlist construction process presented in the paper also guarantees that by using the constructed lexicons high word coverage is achieved in general texts. SIlex lexicons are large-scale phonetic and morphology lexicons for the Slovenian language, constructed within the new framework and with a developed toolset, and represent valuable language resources for the development of various speech processing applications for the Slovenian language.

An artificial life approach for the animation of cognitive characters

This paper addresses the problem of cognitive character animation. We propose the use of finite state machines for the behavioral control of characters. Our approach rests on the idea that the cognitive character arises from the evolutionary computation embedded in the artificial life simulation, which in our case is implemented by the finite state machine. We present some of the results of the WOXBOT/ARENA research project. This project to build virtual worlds is aimed at the graphic simulation of an arena, where small mobile robots can perform requested tasks while behaving according to their own motivation and reasoning. Each robot is an intelligent agent that perceives the virtual environment through a simulated vision system and reacts by moving away from or approaching the object it sees. The conception and specification of the robots and environment are being done very carefully to create an open distributed object architecture that could serve as a test-bed freely available and ready to use for testing theories in some computational areas such as evolutionary computation, artificial life, pattern recognition, artificial intelligence, cognitive neurosciences and distributed objects architectures. Furthermore, it is a first step towards building a cognitive animated character.

The use of finite state machines for task-based machine tool control

Nowadays machine tool control, for small batch sizes, suffers from a lack of flexibility at machine level. The paper proposes a new architecture for machine tool control based on two concepts to increase the flexibility: decentralisation of planning and monitoring towards machine tool control, and the replacement of the traditional ISO-based input format by a task-based data representation. The decentralised planning and monitoring functionalities are grouped into the planning and monitoring module. The implementation of this module is based on a finite state machine (FSM). The use of an FSM offers the possibility to model the planning and monitoring knowledge.

Building testable software

This paper examines a connection between well known specification, design, implementation methodologies and test-design which appears not to have been previously well-formulated. We refer to the fact that the use of finite state machines (FSMs) in each development phase (specification, design, implementation and testing) is well known and documented. However, despite the fact that much of this work is more than twenty years old, there appears to be no detailed proposal for a consistent FSM-based approach be used across all development phases for other than very specific application types. We suggest that the adoption of a systematic FSM-based approach across all phases, including implementation, may allow a number of major problems in software development to be either eliminated or simplified. In this way, testable, highly dependable systems can be produced. In such systems, behaviour is explicitly defined, built, and tested using both functional and structural methods. Undesired behaviours can be found and eliminated, and abnormal or unexpected input explicitly handled. We discuss the issues we consider to be involved, and the benefits which we expect may be gained. We also identify those areas where further work appears to be required.

A dialog-based architecture for interactive information systems

Interactive systems may be defined as having the following behavior: a) the user's request is processed as soon as it is received and b) the result is presented to the user on the same medium, i.e. the screen, as soon as it is available. Interactive Information Systems (IIS), identify those systems often encountered in the business world, which consist of many input-output operations and little, simple processing. In the past few years, interest for IIS has been growing (see JAC 83, MAS83, DRA84): the man-machine interface has received special attention, due to the profile of the user who is not a computer specialist. Very few attempts however, have been made to design an architecture for this class of systems, although their characteristics have definite general design consequences. In this article, we will start by investigating the characteristics of IIS. A presentation of ISA (Interactive System Architecture) will follow, showing the main features of the proposed model. The discussion will then concentrate on the use of finite state machines and on the limitations of ISA.