2006Unpublished venueRequires access

Look-Back Technique to Generate Multistep Finite State Machines

J. M., Arturo Veloz G., Manuel E. Guzman R.

Open publisher page 0 citations

Abstract

Nowadays, technologies are attempting to increase systems speed beyond the limits imposed by the capacity of the systems themselves. That is the case of finite state machines where improving the iteration bound is critical for reaching the desired performance. A good solution to improve them is to parallelize the finite state machines in order to improve their speed. In this paper we propose a methodology that makes use of the Z transform, better known as an important tool for discrete time system characterization. The proposed algorithm, starts from the canonical description of the finite state machine and generates the parallel version of the finite state machine with the desired level of parallelism while preserving its original behavior

About this research paper

What this paper is about

Nowadays, technologies are attempting to increase systems speed beyond the limits imposed by the capacity of the systems themselves. That is the case of finite state machines where improving the iteration bound is critical for reaching the desired performance. A good solution to improve them is to parallelize the finite state machines in order to improve their speed. In this paper we propose a methodology that makes use of the Z transform, better known as an important tool for discrete time system characterization. The proposed algorithm, starts from the canonical description of the finite state machine and generates the parallel version of the finite state machine with the desired level of parallelism while preserving its original behavior

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Nowadays, technologies are attempting to increase systems speed beyond the limits imposed by the capacity of the systems themselves. That is the case of finite state machines where improving the iteration bound is critical for reaching the desired performance. A good solution to improve them is to parallelize the finite state machines in order to improve their speed. In this paper we propose a methodology that makes use of the Z transform, better known as an important tool for discrete time system characterization. The proposed algorithm, starts from the canonical description of the finite state machine and generates the parallel version of the finite state machine with the desired level of parallelism while preserving its original behavior

Key concepts: Finite-state machine, Computer science, State (computer science), Parallelism (grammar), Finite state, Virtual finite-state machine, Algorithm, Parallel computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Look-Back Technique to Generate Multistep Finite State Machines — Research Paper | ScholarLens