Logo image
A method for adding counter-places to the incidence matrix of Petri net
Conference proceeding

A method for adding counter-places to the incidence matrix of Petri net

H. Tanaka, M. Hikichi, Y. Maruyama, Y. Cai, K. Okuno, T. Sekiguchi and IEEE
Proceedings of the 1992 International Conference on Industrial Electronics, Control, Instrumentation, and Automation, pp 1422-1426 vol.3
1992

Abstract

Computer aided instruction Control systems Costs Equations Linear programming Petri nets
It is shown that there are two problems that must be solved when applying a Petri net to an actual case of a sequential control system. The first one is how to divide a large-sized reachability problem into small-size problems that can be solved in a feasible computation time with a computer having a reasonable memory storage capacity. The second problem is how many counter-places would be added and at what positions they should be added. The authors propose a method to divide a Petri net by using the property of place invariants, and add counter-places based on algebraic techniques. An example is given that shows the effectiveness of the approach presented.< >

Metrics

7 Record Views

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Engineering, Electrical & Electronic
Logo image