scholarly journals Improving Datapath Testability by Modifying Controller Specification

VLSI Design ◽  
2002 ◽  
Vol 15 (2) ◽  
pp. 491-498 ◽  
Author(s):  
M. L. Flottes ◽  
B. Rouzeyre ◽  
L. Volpe
Keyword(s):  
Finite Automata ◽  
Digital Circuit ◽  
Automata Theory ◽  
Sharp Fall ◽  
Testability Analysis ◽  
Controllability And Observability ◽  
Control Part

A digital circuit includes two main parts: a controller and a datapath. After connection of these two parts, both are subject to a sharp fall in testability due to the lack of controllability and observability at the interface. In this paper, we propose a method for specifying the control part in order to restore the testability of the datapath to a level close to the initial one, in other words its testability before connection. This testability driven specification affects the next state logic as well as the decoder part of the controller but does not make use of any scan-based element. Based on the finite automata theory and on results of a testability analysis performed on the datapath, the proposed method entails very little area penalty.

Implementing and using finite automata toolkits

1996 ◽  
Vol 2 (4) ◽  
pp. 295-302 ◽  
Author(s):  
BRUCE W. WATSON
Keyword(s):  
Flight Control ◽  
Program Verification ◽  
Finite Automata ◽  
Circuit Simulation ◽  
Implementation Strategies ◽  
Digital Circuit ◽  
General Purpose ◽  
Genetic Sequencing ◽  
Java Program ◽  
Fire Engine

Finite automata and various extensions of them, such as transducers, are used in areas as diverse as compilers, spelling checking, natural language grammar checking, communication protocol design, digital circuit simulation, digital flight control, speech recognition and synthesis, genetic sequencing, and Java program verification. Unfortunately, as the number of applications has grown, so has the variety of implementations and implementation techniques. Typically, programmers will be confused enough to resort to their text books for the most elementary algorithms. Recently, advances have been made in taxonomizing algorithms for constructing and minimizing automata and in evaluating various implementation strategies Watson 1995. Armed with this, a number of general-purpose toolkits have been developed at universities and companies. One of these, FIRE Lite, was developed at the Eindhoven University of Technology, while its commercial successor, FIRE Engine II, has been developed at Ribbit Software Systems Inc. Both of these toolkits provide implementations of all of the known algorithms for constructing automata from regular expressions, and all of the known algorithms for minimizing deterministic finite automata. While the two toolkits have a great deal in common, we will concentrate on the structure and use of the noncommercial FIRE Lite. The prototype version of FIRE Lite was designed with compilers in mind. More recently, computation linguists and communications protocol designers have become interested in using the toolkit. This has led to the development of a much more general interface to FIRE Lite, including the support of both Mealy and Moore regular transducers. While such a toolkit may appear extremely complex, there are only a few choices to be made. We also consider a ‘recipe’ for making good use of the toolkits. Lastly, we consider the future of FIRE Lite. While FIRE Engine II has obvious commercial value, we are committed to maintaining a version which is freely available for academic use.

A closure characterisation of phase-type distributions

1992 ◽  
Vol 29 (01) ◽  
pp. 92-103 ◽  
Author(s):  
Robert S. Maier ◽  
Colm Art O'Cinneide
Keyword(s):  
Analogous Result ◽  
Finite Automata ◽  
Automata Theory ◽  
Phase Type Distribution ◽  
Exponential Distributions ◽  
Phase Type ◽  
Phase Type Distributions ◽  
Discrete Phase ◽  
Rational Sequence ◽  
Family Of Distributions

We characterise the classes of continuous and discrete phase-type distributions in the following way. They are known to be closed under convolutions, mixtures, and the unary ‘geometric mixture' operation. We show that the continuous class is the smallest family of distributions that is closed under these operations and contains all exponential distributions and the point mass at zero. An analogous result holds for the discrete class. We also show that discrete phase-type distributions can be regarded as ℝ+-rational sequences, in the sense of automata theory. This allows us to view our characterisation of them as a corollary of the Kleene–Schützenberger theorem on the behavior of finite automata. We prove moreover that any summable ℝ+-rational sequence is proportional to a discrete phase-type distribution.

The Design Of Digital Test Simulator

1992 ◽  
pp. 71-81
Author(s):  
Mohamed Othman ◽  
Bambang Sunaryo Suparjo
Keyword(s):  
Computer Aided Design ◽  
Logic Circuit ◽  
Testability Analysis ◽  
Computer Aided ◽  
Digital Test ◽  
Analysis System ◽  
Aided Design ◽  
Controllability And Observability ◽  
Combinational Logic Circuit ◽  
Pascal Language

Digital Test Simulator is a Computer Aided Design (CAD) tools written in Turbo Pascal language ver. 5.0. It is a gate level simulator to measures the testability values of a combinational logic circuit. It was developed based on the testability analysis system called Computer-Aided MEsurefor LOgic Testability (CAMELOT). The measurement of the testability, controllability and observability for every nodes are based on the topologyical description of the circuit. The final results produced by simulator can be expressed in the form of table and histogram. Comparison of the various nodal testability values allows the areas of poor testability to be readily identified and the inprovement can be done to the circuits to make it more testable. Key Words: Logic circuit; Computer-Aided Design; CAMELOT approach; Digital Test Simulator

scholarly journals Mobile Learning Application for Language and Automata Theory using Android-based

2020 ◽  
Vol 5 (2) ◽  
pp. 176
Author(s):  
Maulana Muhamad Sulaiman ◽  
Romi Andrianto ◽  
Muhamad Arief Yulianto
Keyword(s):  
Mobile Learning ◽  
Finite Automata ◽  
Automata Theory ◽  
Finite State Automata ◽  
Design Development ◽  
Study Program ◽  
Deterministic Finite Automata ◽  
Implementation Evaluation ◽  
Finite State ◽  
Evaluation Of Learning

The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important materials in language and automata theory. This material requires more understanding of mathematical logic from students to determine an input which can be accepted or rejected in an abstract machine system. The assist students  to understand the material, it is need to develop the learning media for mobile learning applications for language  and automata theory on finite state automata (FSA) and deterministic finite automata (DFA) based on android as an evaluation of learning media for students. And the development of this learning media use the ADDIE development model (analysis, design, development, implementation, evaluation) to  design language and automata theory applications learning so can be support the learning process for students and then assist lecturer to explain the material more dynamic and applicative.

Study on the Modeling Method of Software Process Based on Timing and Parallel Automata

2013 ◽  
Vol 765-767 ◽  
pp. 1537-1540
Author(s):  
Feng Wei Sun ◽  
Li Juan Yuan
Keyword(s):  
Resource Allocation ◽  
Process Modeling ◽  
Process Model ◽  
Finite Automata ◽  
Software Process ◽  
Dynamic Change ◽  
Modeling Method ◽  
Automata Theory ◽  
Progress Control ◽  
Software Process Modeling

The finite automata theory extended and then the timing parallel automata theory is got and applied in the software process modeling. The establishment of group software process model is on the basis of timing parallel automata which realize the activity planning, resource allocation and progress control of process. The process model has been checked rationality and the rationality definition and check rules have been given. The process modeling method in this paper is intuitive, easy to understand and could describe the dynamic change of process, and also present the concurrent activity and provide the effective support to parallel work and cooperative work.

Automata theory based on unsharp quantum logic

2009 ◽  
Vol 19 (4) ◽  
pp. 737-756 ◽  
Author(s):  
YUN SHANG ◽  
XIAN LU ◽  
RUQIAN LU
Keyword(s):  
Quantum Logic ◽  
Finite Automata ◽  
Automata Theory ◽  
Quantum Structures ◽  
Closure Properties ◽  
Mv Algebra ◽  
Quantum Finite Automata ◽  
Distributive Law ◽  
Qmv Algebras ◽  
Mv Algebras

By studying two unsharp quantum structures, namely extended lattice ordered effect algebras and lattice ordered QMV algebras, we obtain some characteristic theorems of MV algebras. We go on to discuss automata theory based on these two unsharp quantum structures. In particular, we prove that an extended lattice ordered effect algebra (or a lattice ordered QMV algebra) is an MV algebra if and only if a certain kind of distributive law holds for the sum operation. We introduce the notions of (quantum) finite automata based on these two unsharp quantum structures, and discuss closure properties of languages and the subset construction of automata. We show that the universal validity of some important properties (such as sum, concatenation and subset constructions) depend heavily on the above distributive law. These generalise results about automata theory based on sharp quantum logic.

Sign in / Sign up

Export Citation Format

Share Document