An Algorithm for Petri Nets Reachability by Unfoldings (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
- 社団法人電子情報通信学会の論文
- 1999-03-25
著者
-
Miyamoto Toshiyuki
Department of Electrical Engineering, Osaka University
-
Kumagai Sadatoshi
Department of Electrical Engineering, Osaka University
-
Kumagai Sadatoshi
Department Of Electrical Electronic And Information Engineering Osaka University
-
Miyamoto Toshiyuki
Department Of Electrical Electronic And Information Engineering Osaka University
-
NAKANO Shun-ichiro
Sharp Corporation
-
Miyamoto Toshiyuki
The Department Of Electrical Engineering Osaka University
関連論文
- An Efficient State Space Search for the Synthesis of Asynchronous Circuits by Subspace Construction
- 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
- 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)
- 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)
- 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