Finite State Automation Research Articles

Ex Post Project Risk Assessment: Method and Empirical Study

Project risk is an important part of managing large projects of any sort. This study contributes to the state of knowledge in project risk management by introducing a data-driven approach to measure risk identification performance using historical data. In the early phases of a project, the identification and assessment of risk is based largely on experience and expert judgment. As a project moves through its life cycle, these identified risks and the assessment of them evolve. Some risks become issues, some are mitigated, and some are retired as no longer important. This study investigated the quality of early risk registers and risk assessments on large transportation projects and compared them to how the identified risks evolved on historical projects. The investigation involved the use of textual analysis of archival risk register documents. Finite-state automation methods akin to Markov chain models were used to track the changes in risk attributes on large infrastructure projects as the projects matured. The objective was to be better able to anticipate how project risks will change as projects move forward and to be better able to forecast changes to the risk register from ex ante to ex post conditions. Results from 11 major US transportation projects suggested that, on average, fewer than 65% of ex ante identified risks ultimately occurred in projects and were mitigated, while more than 35% did not occur and were retired. In addition, more than half of the risks emerged during project execution when new information became available. Based on the categorization of risk management styles, we find that identifying risks early in the project life cycle is necessary, but not sufficient to ensure successful project delivery. A project team with positive doer behavior (i.e., actively monitoring and identifying risks during project execution) performed better in delivering projects on time and within budget.

Distributed Business Process Discovery in Cloud Clusters

The processing of big data across different axes is becoming more and more difficult and the introduction of the Hadoop MapReduce framework seems to be a solution to this problem. With this framework, large amounts of data can be analyzed and processed. It does this by distributing computing tasks between a group of virtual servers operating in the cloud or a large group of devices. The mining process forms an important bridge between data mining and business process analysis. Its techniques make it possible to extract information from event reports. The extraction process generally consists of two phases: identification or discovery and innovation or education. Our first task is to extract small patterns from the log effects. These templates represent the implementation of the tracking from a business process report file. In this step we use the available technologies. Patterns are represented by finite state automation or regular expressions. And the final model is a combination of just two different styles.

Business Process Discovery Using Process Mining Techniques and Distributed Framework

The processing of big data across different axes is becoming more and more difficult and the introduction of the Hadoop MapReduce framework seems to be a solution to this problem. With this framework, large amounts of data can be analyzed and processed. It does this by distributing computing tasks between a group of virtual servers operating in the cloud or a large group of devices. The mining process forms an important bridge between data mining and business process analysis. Its techniques make it possible to extract information from event reports. The extraction process generally consists of two phases: identification or discovery and innovation or education. Our first task is to extract small patterns from the log effects. These templates represent the implementation of the tracking from a business process report file. In this step we use the available technologies. Patterns are represented by finite state automation or regular expressions. And the final model is a combination of just two different styles.

Integer Linear Programming Based Topology Design for GNSSs With Inter-Satellite Links

Inter-satellite links (ISLs) can be employed in global navigation satellite systems (GNSSs) for space-based telemetry, telecommand and ranging, which reduces the requirement for a large number of ground stations (GSs). However, the polling time division duplex (PTDD) ranging hierarchy of the ISLs raises the topology design problem of the networks. To optimize the communication performance with the constraint of ranging for precise orbit determination in GNSSs, we model the ISLs network with finite state automation (FSA) and solve the optimization problem with integer linear programming (ILP). With the proposed method, for the first time, optimal delay and throughput are both achieved for data transmission between satellites and GSs with guaranteed ranging performance. Simulation results corroborate that, compared with two existing methods, the proposed scheme largely improves the communication performance, i.e., the average delay and the network throughput by 46.9% and 11%, respectively.

Public key digital contents confidentiality scheme based on quantum spin and finite state automation

Numerous encryption plans are legitimately founded on the transformation of frameworks or by characterizing the strict guidelines. Most of the security systems are based on mathematical structures and their applications in diverse applied sciences. We propose here an advanced digital contents confidentiality scheme to simulate the phenomenon rather than creating rigid rules. We operate digital data trailed by quantum spin states for specific phase and finite state machine for limited number of rounds. The extent of the presented article revolves around the development and deployment of public key cryptosystem basis on the concepts of quantum spin states and finite state machine effectively. Both states (spin and finite state machine) provide the high degree of naturalness contrasted with ordinary cryptosystem.

Design of Reversible Number Generator using Finite State Automation Realization

Objective: The objective of this paper is to realize an n-bit reversible number generator. Several designs of number generator and their corresponding constraints with feedback controller and initial state have also been discussed. Method/Analysis: The proposed design is validated by simulating the results in Verilog HDL. Findings: In this paper a design is presented to implement an n bit number generator as a finite state automation, using reversible logic for the implementation of the transition network. A realizable circuit is designed to implement the n-bit number generator using feedback controllers. Novelty/Improvement: With the use of reversible logic, the designed circuit reaches all the possible states and consumes no power.

Interpretation of java - object oriented language: application of chomsky context free grammar and finite state automation

Interpretation of java - object oriented language: application of chomsky context free grammar and finite state automation

Decentralized Control of Linear Switched Nested Systems With $\ell_{2}$-Induced Norm Performance

This paper considers a decentralized switched control problem where exact conditions for controller synthesis are obtained in the form of semidefinite programming (SDP). The formulation involves a discrete-time switched linear plant that has a nested structure, and whose system matrices switch between a finite number of values according to finite-state automation. The goal of this paper is to synthesize a commensurately nested switched controller to achieve a desired level of $\ell_{2}$ -induced norm performance. The nested structures of both plant and controller are characterized by block lower-triangular system matrices. For this setup, exact conditions are provided for the existence of a finite path-dependent synthesis. These include conditions for the completion of scaling matrices obtained through an extended matrix completion lemma. When individual controller dimensions are chosen at least as large as the plant, these conditions reduce to a set of linear matrix inequalities. The completion lemma also provides an algorithm to complete closed-loop scaling matrices, leading to inequalities for controller synthesis that are solvable either algebraically or numerically through SDP.

Data Structure Analysis to Represent Basic Models of Finite State Automation

Data Structure Analysis to Represent Basic Models of Finite State Automation

Research on Reconfigurable Network Model with Finite State Analysis

The paper aims to develop an updated network system reconfigurable model based on the Finite State Automation. Firstly, the paper reviews the concept of reconfigurable network systems and reveals its robustness, evolution and the basic attributes of survivability.Then the system robust behavior, evolution behavior and survival behavior are described with a hierarchical model. Secondly, the study builds the quantitative reconfigurable metric with network topology reconfigurable measurement example. Finally, the result of experiments shows that the proposed reconfigurable quantitative indicator of reconfigurable resistance model suggests that the network is an efficient reconfigurable network topology, which can effectively adapt the dynamic changes in the environment.

Research of Network System Reconfigurable Model Based on the Finite State Automation

Since the network analysis model based on the system state exists the issues of network survivability safety, fault tolerance and dynamic ability are adapted to the environment changes, in this paper, network system model based on the finite state automation has reconfigurable quality. The model first puts forward the concept of reconfigurable network systems and reveals its robustness, evolution and the basic attributes of survivability. By establishing a hierarchical model of system state, the system robust behavior, evolution behavior and survival behavior are described. Secondly, network topology reconfigurable measurement as an example, puts forward the quantitative reconfigurable metrics. At last, the example verification. Experiments show that the proposed reconfigurable quantitative indicators of reconfigurable resistance model for [1.391, 1.140, 1.591] prove that the network is an efficient reconfigurable network topology, which can effectively adapt the dynamic changes in the environment

ENCRYPTIONS OF DATA STREAMS USING PAULI SPIN � MATRICES AND FINITE STATE MACHINE

Cryptography is the science of transmission and reception of secret messages. Recently electronic communication has become an essential part of every aspect of human life. Message encryption has become very essential to avoid the threat against possible attacks by hackers during transmission process of the message. Finite state machines (FSM), also known as finite state automation (FSA), at their simplest, are models of the behaviors of a system or a complex object, with a limited number of defined conditions or modes, where mode transitions change with circumstance. In the present paper, new cryptographic scheme is proposed using finite state machine and Pauli spins 1⁄2 matrices.

Model of a single-row flow of cars: Derivation and integration of equations

A chain of cars moving one after another in a single traffic lane is considered. It is assumed that the cars are point particles and these particles interact with adjacent ones according to the safe distance law. The differential functional equations of the particle flow are derived, and their solution is obtained. Boundary conditions at sections of particle input and output from a piece of a traffic lane are added to the equations. It is shown that models of a single-row flow of particles can be constructed as a chain of a finite number of mass points in a friction-free channel with pulse control as well as a finite-state automation model.

Minimum flow maximum residual routing in LEO satellite networks using routing set

Satellite networks are used as backup networks to the terrestrial communication systems. In this work, we tried to find a routing strategy over dynamic satellite systems to better utilize the capacity of the network. The satellite networks are not affected by natural disasters, therefore they can be used widely during and after disasters. The Minimum Flow Maximum Residual (MFMR) routing algorithm over the Routing Set boundaries is proposed in order to better utilize the capacity of the system by distributing the load over the shortest path alternatives of the system. We assumed the satellite network as having finite states and formulated the problem by using Finite State Automation concept along with earth-fixed cell strategy by using a virtual satellite network model. The routing problem in satellite networks is previously studied in the literature and it is conjectured that the problem is NP-Hard. The online and offline problems are stated and the MFMR algorithm is described in detail. The algorithm is compared with alternatives by simulating the network on Opnet Modeler. Finally, the performance analysis of different scenarios is given in this work.

VERIFICATION METHOD FOR EMBEDDED REAL TIME SYSTEMS OF AEROSPACE APPLICATION

A difference between deterministic and non-deterministic architectures of digital control systems is explained. A finite-state automation model for the system units is used. A verification method for non-deterministic architecture is proposed. This method is based on graph isomorphism – comparing different parts of architectures without using specific rules or algorithms. It can be useful in multi-purpose Computer-Aided Design (CAD) tools for aerospace applications.

Automated consistency checking of requirements specifications

This article describes a formal analysis technique, called consistency checking , for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed in the SCR (Software Cost Reduction) tabular notation. As background, the SCR approach to specifying requirements is reviewed. To provide a formal semantics for the SCR notation and a foundation for consistency checking, a formal requirements model is introduced; the model represents a software system as a finite-state automation which produces externally visible outputs in response to changes in monitored environmental quantities. Results of two experiments are presented which evaluated the utility and scalability of our technique for consistency checking in real-world avionics application. The role of consistency checking during the requirements phase of software development is discussed.

Inference of k-testable languages in the strict sense and application to syntactic pattern recognition

The inductive inference of the class of k-testable languages in the strict sense (k-TSSL) is considered. A k-TSSL is essentially defined by a finite set of substrings of length k that are permitted to appear in the strings of the language. Given a positive sample R of strings of an unknown language, a deterministic finite-state automation that recognizes the smallest k-TSSL containing R is obtained. The inferred automation is shown to have a number of transitions bounded by O(m) where m is the number of substrings defining this k-TSSL, and the inference algorithm works in O(kn log m) where n is the sum of the lengths of all the strings in R. The proposed methods are illustrated through syntactic pattern recognition experiments in which a number of strings generated by ten given (source) non-k-TSSL grammars are used to infer ten k-TSSL stochastic automata, which are further used to classify new strings generated by the same source grammars. The results of these experiments are consistent with the theory and show the ability of (stochastic) k-TSSLs to approach other classes of regular languages.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A versatile data string-search VLSI

A versatile data string-search VLSI has been fabricated using 1.6- mu m CMOS technology. The VLSI consists of an 8 K content addressable memory (CAM) and a 20 K-gate finite-state automation logic (FSAL). A number of unique functions, such as strict/approximate-match string search and fixed/variable-length 'don't care' operations, were implemented. A total of 217600 transistors have been integrated on an 8.62*12.76-mm die. The unique functions were efficiency tested by the scan path method. The data comparison rate was 5.12 billion characters/s in text-search application.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Segmentation of the epileptic EEG by means of a finite state automation

The aims and merits of the syntactical decomposition of the epileptic EEG are discussed in some detail. General assumptions in the design of segmenting algorithm - an essential part of the reduction of data program - are considered and a working example of segmenting routine os presented. This routine is designed as a finite state automaton, equivalent to a formal regular grammar. The performance of the routine on two sets of experimental data is presented and its intrinsic stability is shown in terms of cluster analysis of the segments produced. Means of extension of the proposed scheme to other cases of potential interest as well as possible applications in the higher level syntactical analysis are pointed out.

A simple system for generating efficient lexical scans

A language for specifying lexical scans is described.The language uses the model of a finite state automation with a limited back-up facility.It is efficiently implementable and is machine independent except for one statement which depends on the machine's character set.