State equation, controllability, and maximal matchings of petri nets
- 1 June 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 22 (3) , 412-416
- https://doi.org/10.1109/tac.1977.1101509
Abstract
Petri nets are a versatile modeling device for studying the structure and control of concurrent systems. Petri nets and related graph models have been used for modeling a wide variety of systems from computers to social systems. In order to introduce this interesting modeling device to the researcher in control theory, this paper discusses Petri nets in the context of the state equation for a linear discrete-time system. The controllability concept of dynamic systems is applied to Petri nets for the first time. It is also shown that the controllability and reachability of a Petri net are related to maximal matchings of its bipartite graph.Keywords
This publication has 12 references indexed in Scilit:
- Automated land use and vegetation monitoring to enable efficient management of Britain's off track railway assetsPublished by Institution of Engineering and Technology (IET) ,2011
- A Methodology for the Design and Implementation of Communication ProtocolsIEEE Transactions on Communications, 1976
- Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)Published by Association for Computing Machinery (ACM) ,1976
- Systems of open paths in Petri netsLecture Notes in Computer Science, 1975
- Asynchronous Control ArraysIEEE Transactions on Computers, 1974
- Macro E-Nets for Representation of Parallel SystemsIEEE Transactions on Computers, 1973
- Reachability Problems in Vector Addition SystemsThe American Mathematical Monthly, 1973
- Evaluation nets for computer system performance analysisPublished by Association for Computing Machinery (ACM) ,1972
- Marked directed graphsJournal of Computer and System Sciences, 1971
- Properties of a Model for Parallel Computations: Determinacy, Termination, QueueingSIAM Journal on Applied Mathematics, 1966