Results 1 - 10 of 413

Principles and methods of Testing Finite State Machines -- a survey

by David Lee, Mihalis Yannakakis - PROCEEDINGS OF IEEE , 1996
"... With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This moti ..."
Abstract - Cited by 345 (16 self) - Add to MetaCart
and observing the outputs produced. Because of its practical importance and theoretical interest, the problem of testing finite state machines has been studied in different areas and at various times. The earliest published literature on this topic dates back to the 50’s. Activities in the 60’s and early 70’s

State-Identification Problems for Finite-State Transducers (extended abstract)

by Moez Krichen, Stavros Tripakis
"... Abstract. A well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state, and w ..."
Abstract - Add to MetaCart
Abstract. A well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state

Your Botnet is My Botnet: Analysis of a Botnet Takeover

by Brett Stone-gross, Marco Cova, Lorenzo Cavallaro, Bob Gilbert, Martin Szydlowski, Richard Kemmerer, Christopher Kruegel, Giovanni Vigna
"... Botnets, networks of malware-infected machines that are controlled by an adversary, are the root cause of a large number of security problems on the Internet. A particularly sophisticated and insidious type of bot is Torpig, a malware program that is designed to harvest sensitive information (such a ..."
Abstract - Cited by 171 (28 self) - Add to MetaCart
Botnets, networks of malware-infected machines that are controlled by an adversary, are the root cause of a large number of security problems on the Internet. A particularly sophisticated and insidious type of bot is Torpig, a malware program that is designed to harvest sensitive information (such

Finite State Machines from Feature Grammars

by Alan W. Black - International Workshop on Parsing Technologies , 1989
"... This paper describes the conversion of a set of feature grammar rules into a deterministic finite state machine that accepts the same language (or at least a well-defined related language). First the reasoning behind why this is an interesting thing to do within the Edinburgh speech recogniser proje ..."
Abstract - Cited by 21 (0 self) - Add to MetaCart
This paper describes the conversion of a set of feature grammar rules into a deterministic finite state machine that accepts the same language (or at least a well-defined related language). First the reasoning behind why this is an interesting thing to do within the Edinburgh speech recogniser

Integrable Hamiltonian for classical strings on ADS5 × S 5

by Gleb Arutyunov, Sergey Frolov , 2004
"... We find the Hamiltonian for physical excitations of the classical bosonic string propagating in the AdS5 × S5 space-time. The Hamiltonian is obtained in a so-called uniform gauge which is related to the static gauge by a 2d duality transformation. The Hamiltonian is of the Nambu type and depends on ..."
Abstract - Cited by 102 (13 self) - Add to MetaCart
We find the Hamiltonian for physical excitations of the classical bosonic string propagating in the AdS5 × S5 space-time. The Hamiltonian is obtained in a so-called uniform gauge which is related to the static gauge by a 2d duality transformation. The Hamiltonian is of the Nambu type and depends

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
of production belongs exclusively to the relationships of production. In this view, the notion, for instance, of a capitalist state, is void of theoretical meaning, although it can usefully characterize an empirical observation, when a given state is primarily geared toward the preservation and promotion

Computing with Relational Machines

by Gérard Huet, Benoît Razet , 2008
"... Abstract. We give a quick presentation of the X-machines of Eilenberg, a generalisation of finite state automata suitable for general nondeterministic computation. Such machines complement an automaton, seen as its control component, with a computation component over a data domain specified as an ac ..."
Abstract - Add to MetaCart
Abstract. We give a quick presentation of the X-machines of Eilenberg, a generalisation of finite state automata suitable for general nondeterministic computation. Such machines complement an automaton, seen as its control component, with a computation component over a data domain specified

Learning a Class of Large Finite State Machines with a Recurrent Neural Network

by C. Lee Giles, B. G. Horne, T. Lin , 1995
"... One of the issues in any learning model is how it scales with problem size. The problem of learning finite state machine (FSMs) from examples with recurrent neural networks has been extensively explored. However, these results are somewhat disappointing in the sense that the machines that can be le ..."
Abstract - Cited by 22 (11 self) - Add to MetaCart
One of the issues in any learning model is how it scales with problem size. The problem of learning finite state machine (FSMs) from examples with recurrent neural networks has been extensively explored. However, these results are somewhat disappointing in the sense that the machines that can

A Finite State Machine Model to Support the Visualization of Complex Dynamic Systems

by unknown authors
"... Abstract — Linear and non-linear controllable systems are commonly found in many engineering problems and are examples of models that involve complex high-dimensional spatially-related data sets. Such systems range in size and complexity from small-scale systems of a few state variables to large-sca ..."
Abstract - Add to MetaCart
termed Orthogonal Organized Finite State Machines (OOFSM) is proposed as a modeling technique to support visualizations of the properties of these types of complex systems. Linear and non-linear controllable systems are commonly found in many engineering problems [1]. Such systems range in size

KEYWORDS: Sequential Circuits, Built-In Self-Test, Finite State Machines, Design-for-Testability

by Jaan Raik, Elmet Orasson, Raimund Ubar
"... ABSTRACT: The paper proposes a Design-for-Testability (DfT) technique of Built-In Self-Test (BIST) for sequential circuits. The technique is based on making the status signals entering the control part controllable during the test mode to force the device under test to traverse all the branches in t ..."
Abstract - Add to MetaCart
in the FSM state transition graph. Extra outputs are added to the circuit under test in order to observe the values of the status bits masked out. This type of architecture requires little device area overhead since a simple controller can be implemented to manipulate the control signals. Experiments were
Results 1 - 10 of 413