Structure of the submarking-reachability problem and network programming
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 35 (1) , 89-100
- https://doi.org/10.1109/31.1702
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex methodIEEE Transactions on Circuits and Systems, 1987
- Structure matrices for petri nets and their applicationsJournal of the Franklin Institute, 1985
- Submarking reachability of marked graphsIEEE Transactions on Circuits and Systems, 1984
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Petri NetsACM Computing Surveys, 1977
- Circuit theoretic analysis and synthesis of marked graphsIEEE Transactions on Circuits and Systems, 1977
- State equation, controllability, and maximal matchings of petri netsIEEE Transactions on Automatic Control, 1977
- Marked directed graphsJournal of Computer and System Sciences, 1971
- Properties of a Model for Parallel Computations: Determinacy, Termination, QueueingSIAM Journal on Applied Mathematics, 1966