An Efficient State Space Search for the Synthesis of Asynchronous Circuits by Subspace Construction
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, an approach to derive a logic function of asynchronous circuits from a graph-based model called Signal Transition Graphs (STG) [1] is discussed. STG's are Petri nets [2], whose transitions are interpreted as a signal transition on the circuit inputs or gate outputs, and its marking represents a binary state of the circuit. STG's can represent a behavior of circuit, to derive logic functions, however, the reachability graph should be constructed. In the verification of STG's some method based on Occurrence nets (OCN) and its prefix, called unfolding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating substate space of a given STG using the structural properties of OCN. The proposed method can be seem as a parallel algorithm for deriving a logic function.
- 社団法人電子情報通信学会の論文
- 1995-11-25
著者
-
Lee D‐i
Gwangju Inst. Of Sci. And Technol. Kor
-
Miyamoto Toshiyuki
Department of Electrical Engineering, Osaka University
-
Dong-Ik Lee
Department of Information and Communication, Kwang-Ju Institute of Science and Technology
-
Kumagai Sadatoshi
Department of Electrical Engineering, Osaka University
-
Lee Dong-ik
Department Of Information And Communications Gwangju Institute Of Science And Technology
-
Dong-ik Lee
Department Of Information And Communication Kwang-ju Institute Of Science And Technology
-
Kumagai Sadatoshi
Department Of Electrical Electronic And Information Engineering Osaka University
-
Miyamoto Toshiyuki
Department Of Electrical Electronic And Information Engineering Osaka University
-
Miyamoto Toshiyuki
The Department Of Electrical Engineering Osaka University
関連論文
- An Efficient State Space Search for the Synthesis of Asynchronous Circuits by Subspace Construction
- Test Generation for SI Asynchronous Circuits with Undetectable Faults from Signal Transition Graph Specification(Special Section on Papers Selected from ITC-CSCC 2000)
- Synthesis for Testability of Synchronous Sequential Circuits with Strong-Connectivity Using Undefined States on State Transition Graph(Test)(VLSI Design and CAD Algorithms)
- High-Level Test Generation for Asynchronous Circuits from Signal Transition Graph(Special Section on VLSI Design and CAD Algorithms)
- Equivalent Net Reduction for Firing Sequence
- A Graph Based Approach for an Extended Resource Planning and Line Balancing Problem(Concurrent System Technology)
- A Graph Based Approach for an Extended Resource Planning and Line Balancing Problem
- An Electric Circuit Model of Flow-Shops and Its Sensitivity Analysis
- Asynchronous Array Multiplier with an Asymmetric Parallel Array Structure(Computer System Element)
- Stabilization of Timed Discrete Event Systems with Forcible Events (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
- A Forbidden Marking Problem in Controlled Complementary-Places Petri Nets
- Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method
- An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs(Concurrent/Hybrid Systems : Theory and Applications)
- A Survey of Object-Oriented Petri Nets and Analysis Methods(Concurrent/Hybrid Systems : Theory and Applications)
- Balanced State Feedback Controllers for Discrete Event Systems Described by the Golaszewski-Ramadge Model
- A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity(Concurrent/Hybrid Systems : Theory and Applications)
- Lead-Free Piezoelectric Ceramics with Large Dielectric and Piezoelectric Constants Manufactured from BaTiO3 Nano-Powder
- On Reachability Analysis of Multi Agent Nets(Systems Theory and Control,Nonlinear Theory and its Applications)
- An Optimal Share Transfer Problem on Secret Sharing Storage Systems(Concurrent/Hybrid Systems : Theory and Applications)
- An Algorithm for Petri Nets Reachability by Unfoldings (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
- A Graph Theoretic Approach to Reachability Problem with Petri Net Unfoldings (Special Section on Description Models for Concurrent Systems and Their Applications)
- An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits (Special Section of Papers Selected from JTC-CSCC'95)
- Context-Dependent Agents for Real-Time Scheduling in Manufacturing Systems(Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
- Design of Decoupled Wrapper for Globally Asynchronous Locally Synchronous Systems(Papers Selected from 2003 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC 2003))
- MceSim : A Multi-Car Elevator Simulator
- On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings (Special Issue on Asynchronous Circuit and System Design)
- Multi Criteria Real-Time Scheduling for Manufacturing Systems by Context-Dependent Agents
- Multi Criteria Real-Time Scheduling for Manufacturing Systems by Context-Dependent Agents(Concurrent System Technology)
- A Multi-Agent Based Manufacturing Resource Planning and Task Allocation System
- Automatic Repair Mechanism of Secret Sharing Storage System(Database)
- One-Time Key Generation System for Agent Data Protection
- Option-Based Monte Carlo Algorithm with Conditioned Updating to Learn Conflict-Free Task Allocation in Transport Applications
- Performance Evaluation of an Option-Based Learning Algorithm in Multi-Car Elevator Systems
- FOREWORD