scholarly journals Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Bilal Elghadyry ◽  
Faissal Ouardi ◽  
Zineb Lotfi ◽  
Sébastien Verel
Keyword(s):  
Finite State Machine ◽  
Exact Algorithm ◽  
Finite State Machines ◽  
Identification Problem ◽  
State Machine ◽  
State Machines ◽  
State Identification ◽  
Distinguishing Sequences ◽  
Wide Range ◽  
Finite State

AbstractDistinguishing sequences are widely used in finite state machine-based conformance testing to solve the state identification problem. In this paper, we address the scalability issue encountered while deriving distinguishing sequences from complete observable nondeterministic finite state machines by introducing a massively parallel MapReduce version of the well-known Exact Algorithm. To the best of our knowledge, this is the first study to tackle this task using the MapReduce approach. First, we give a concise overview of the well-known Exact Algorithm for deriving distinguishing sequences from nondeterministic finite state machines. Second, we propose a parallel algorithm for this problem using the MapReduce approach and analyze its communication cost using Afrati et al. model. Furthermore, we conduct a variety of intensive and comparative experiments on a wide range of finite state machine classes to demonstrate that our proposed solution is efficient and scalable.

scholarly journals Reduction in the Number of PAL Macrocells in the Circuit of a Moore FSM

2007 ◽  
Vol 17 (4) ◽  
pp. 565-575 ◽  
Author(s):  
Alexander Barkalov ◽  
Larysa Titarenko ◽  
Sławomir Chmielewski
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
Optimization Methods ◽  
State Machine ◽  
Logic Circuits ◽  
State Machines ◽  
Embedded Memory ◽  
Effective Application ◽  
Finite State

Reduction in the Number of PAL Macrocells in the Circuit of a Moore FSMOptimization methods of logic circuits for Moore finite-state machines are proposed. These methods are based on the existence of pseudoequivalent states of a Moore finite-state machine, a wide fan-in of PAL macrocells and free resources of embedded memory blocks. The methods are oriented to hypothetical VLSI microcircuits based on the CPLD technology and containing PAL macrocells and embedded memory blocks. The conditions of effective application of each proposed method are shown. An algorithm to choose the best model of a finite-state machine for given conditions is proposed. Examples of proposed methods application are given. The effectiveness of the proposed methods is also investigated.

scholarly journals Supply Chain Food Management using HFSM for RTS Game

2018 ◽  
Author(s):  
Dihin Muriyatmoko
Keyword(s):  
Supply Chain ◽  
User Interface ◽  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Game Play ◽  
Food Management ◽  
Finite State ◽  
Rts Game

Finite state machines have becomeextremely popular over the last decade and helpedgame developers build some pretty fun RTS games[1]. Finite State Machines have been widely used asa tool for developing RTS games, especially aspertains to solving problems related to AI, inputhandling, and game progression [2]. Anyhow, tocontrol game play and user interface for SupplyChain Management (SCM) of Food on RTS gameonly played conventional finite state machine(FSM) design. Therefore in this research isdeveloped Food SCM using Hierarchical StateFinite Machine (HFSM).HFSM allow for a modulardevelopment of states that is more maintainable andscalable[3]. The formalism of HFSM makes thestate machine approach truly applicable to real-lifeembedded systems [4].

scholarly journals Gift – An Integrated Development and Training System for Finite State Machine Based Approaches

2017 ◽  
Vol 13 (08) ◽  
pp. 147 ◽  
Author(s):  
Karsten Henke ◽  
Tobias Fäth ◽  
René Hutschenreuter ◽  
Heinz-Dietrich Wuttke
Keyword(s):  
Control Systems ◽  
Digital Control ◽  
Communication Systems ◽  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Digital Control Systems ◽  
Teaching Concept ◽  
Finite State

At the Ilmenau University of Technology’s “Integrated Communication Systems” Department a main teaching concept deals with the design of digital control systems. Different lectures from the 1st to the 8th semester are using Finite State Machines (FSM) as a specification technique to realize different design tasks. During undergraduate studies the basics of Finite State Machines and their usage within the design of digital control systems are taught. To conceptualize more complex digital systems, as required in higher courses, it is necessary to use powerful toolsets. One example of such a toolset is the GIFT (Graphical Interactive Finite State Machine Toolset) system, developed by the Integrated Communications System Group at the Ilmenau University of Technology. With this toolset we want to extent our remote lab GOLDi and implement new techniques for a web-based development system for Finite State Machines.

scholarly journals Applications of Cubic Structures to Subsystems of Finite State Machines

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 598 ◽  
Author(s):  
Nabilah Abughazalah ◽  
Naveed Yaqoob
Keyword(s):  
Direct Product ◽  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Finite State

This paper concerns three relationship between the recently proposed cubic sets and finite state machines. The notions of cubic finite state machine (cubic FSM), a subsystem of cubic FSM and cartesian composition (direct product, P-(R-) union, and P-(R-) intersection) of two subsystems of cubic FSMs are introduced. We study the cartesian composition, direct product and union of two subsystems of cubic FSMs is a subsystem of a cubic FSM. We provide many examples on each case. We consider conditions for subsystem of cubic FSM to be both an internal cubic subsystem of cubic FSM and an external cubic subsystem of cubic FSM.

ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES

2008 ◽  
Vol 19 (02) ◽  
pp. 453-476 ◽  
Author(s):  
JEAN-MARC CHAMPARNAUD ◽  
FRANCK GUINGNE ◽  
ANDRÉ KEMPE ◽  
FLORENT NICART
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
General Algorithm ◽  
State Machines ◽  
Practical Applications ◽  
Rational Relation ◽  
Finite State

A weighted finite-state machine with n tapes describes a rational relation on n strings. We recall some basic operations on n-ary rational relations, recast the important join operation in terms of "auto-intersection", and propose restricted algorithms for both operations. If two rational relations are joined on more than one tape, it can unfortunately lead to non-rational relations with undecidable properties. As a consequence, there cannot be a fully general algorithm, able to compile any rational join or auto-intersection. We define a class of triples 〈A,i,j〉 for which we are able to compile the auto-intersection of the machine A w.r.t. tapes i and j. We hope that this class is sufficient for many practical applications.

scholarly journals Research on the Properties of Lattice-Valued Finite State Machines in Computer Technology

2021 ◽  
Vol 2066 (1) ◽  
pp. 012063
Author(s):  
Zhonggang Hu
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
Exchange Capacity ◽  
State Machines ◽  
Strong Connectivity ◽  
Algebraic Properties ◽  
Finite State ◽  
Strongly Connected ◽  
Homomorphic Mapping

Abstract In this paper, we discuss some algebraic properties of Lattice valued finite state machine and prove that if there are homomorphic mapping satisfying certain conditions between two Lattice valued finite state machines, the first one is strongly connected (cycle), then then the second one is the same. And if the homomorphism is strongly homomorphic, one of the Lattice valued finite state machines is complete if and only if another Lattice valued finite state machine is complete. Discuss the completeness, strong connectivity, circulation and exchange capacity between the product of a Lattice valued finite state machine and the original Lattice valued finite state machine and get some results.

scholarly journals СТРУКТУРНЫЕ КОНЕЧНЫЕ АВТОМАТЫ В ВИДЕ ТЕНЗОРОВ ТРЕТЬЕГО РАНГА ТИПА СУДОКУ

2019 ◽  
pp. 79-87
Author(s):  
Юрий Михайлович Пенкин ◽  
Алина Александровна Федосеева
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Natural Numbers ◽  
Structural Synthesis ◽  
Initial State ◽  
Logical Scheme ◽  
The Third ◽  
Finite State

The construction concept and general principles of the operation of a new kind of finite state machine are presented, for which the input and output elements are panels of square matrices, and the transitions between their states are determined by numerical tensors of the third rank. In this case, the structure of the tensors is specified in the form of cubic grids, in whose cells' natural numbers are located according to the principle of Sudoku construction. An algorithm for constructing such tensors of arbitrary size is indicated. The structures of tensors constructed using ranked sets of natural numbers are defined as standard. It is shown that the possibility of determining Sudoku type tensors using a one-dimensional parameter is basic for the manifestation of their functional self-similarity. The property of additive conservation of the structure of numerical tensors of the third rank to the requirements of Sudoku is formulated as a theorem. It is proved that the tensor obtained by summing an arbitrary tensor structure and a constant, taking into account the introduced cyclic ranking rule, satisfies the general requirements of Sudoku. The problems of abstract and structural synthesis of finite state machine based on the analyzed tensor structures are considered. In this case, the task of abstract synthesis has traditionally been defined as the creation of a mathematical model of an automaton, and the task of structural synthesis is just the development of its functional logical scheme. Based on the ambiguity of the function of the output of the finite state machine, the possibility of the simultaneous use of several different output alphabets is substantiated. The modes of functioning of the minimal finite state machine of the proposed type are described by the example of an initial state machine with a distinguished standard initial state. In the general case, it is shown that the finite state machines defined on the group of these requirements can be attributed to generalized first-order finite-state machines (or Mealy machines) with a multi-valued output. The features of network applications of structural automata are presented. Variants of possible applications of the considered finite state machines are analyzed.

Finite-State-Machine Representations for Mechanisms and Chains With Variable Topologies

2000 ◽  
Author(s):  
Hong-Sen Yan ◽  
Nien-Te Liu
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Topological Structures ◽  
Finite State ◽  
Crank Mechanism

Abstract This paper provides a novel representation for the topological structures of mechanisms and chains with variable topologies. The concept is finite state machines. Graphs are traditional representations of mechanism topologies and have the advantages of easily observing. Finite state machine is proposed for expressing the changes of input links and operating stages. The double-dwell slider-crank mechanism is applied as an example to illustrate the proposed representations. These representations are useful for analyzing the characteristics of topology structures of mechanisms and chains with variable topologies. And, the result of this work can be extended for synthesizing mechanisms and chains with variable topologies.

scholarly journals Pioneer: A New Tool for Coding of Multi-Level Finite State Machines Based on Evolution Programming

VLSI Design ◽  
1994 ◽  
Vol 2 (2) ◽  
pp. 105-116
Author(s):  
S. Muddappa ◽  
R. Z. Makki ◽  
Z. Michalewicz ◽  
S. Isukapalli
Keyword(s):  
Finite State Machines ◽  
Mutation Rates ◽  
Natural Phenomenon ◽  
State Machines ◽  
State Assignment ◽  
Wide Range ◽  
Finite State ◽  
Multi Level ◽  
Crossover And Mutation ◽  
Evolution Programs

In this paper we present a new tool for the encoding of multi-level finite state machines based on the concept of evolution programming. Evolution programs are stochastic adaptive algorithms, based on the paradigm of genetic algorithms whose search methods model some natural phenomenon: genetic inheritance and Darwinian strife for survival. Crossover and mutation rates were tailored to the state assignment problem experimentally. We present results over a wide range of MCNC benchmarks which demonstrate the effectiveness of the new tool. The results show that evolution programs can be effectively applied to state assignment.

Sign in / Sign up

Export Citation Format

Share Document