State equation, controllability, and maximal matchings of petri nets
From MaRDI portal
Publication:4126143
DOI10.1109/TAC.1977.1101509zbMath0354.93010OpenAlexW2112594687MaRDI QIDQ4126143
Publication date: 1977
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.1977.1101509
Controllability (93B05) Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05)
Related Items
An environmental input-output model with multiple criteria, Analysis of petri nets by partitioning: splitting places or transitions, A tabular method for the analysis of large petri nets, Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks, Adaptive expectations and dynamic adjustment in noncooperative games with incomplete information, Structural Reductions Revisited, On the saddle-point stability for a class of dynamic games, Reachability determination in acyclic Petri nets by cell enumeration approach, Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets, The von Neumann facet and a global asymptotic stability, Occam's razor applied to the Petri net coverability problem, The instantaneous speed of adjustment assumption and stability of economic models, One novel and optimal deadlock recovery policy for flexible manufacturing systems using iterative control transitions strategy, Analysis of Petri nets by partitioning: Splitting transitions, State equations and equivalent transformations for timed Petri nets, Lifted structural invariant analysis of Petri net product lines, A test of restrictions in a dynamic singular demand system: An application to the import of intermediate goods in West Germany, A constrained optimal control program in APL, Symbolic and Structural Model-Checking