John O. Moody

Learn More
This paper described a method for constructing a Petri net feedback controller for a discrete event system modeled by a Petri net. The controller enforced a set of inequality constraints on the reachable markings of the Petri net model. First the controllers of the constrained places were computed based on the concept of Petri net place invariants, and then(More)
A supervisor synthesis technique for Petri net plants with uncontrollable and unobservable transitions that enforces the conjunction of a set of linear inequalities on the reachable markings of the plant is presented. The approach is based on the concept of Petri net place invariants. Each step of the procedure is illustrated through a running example(More)
Given an arbitrary Petri net (PN) structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear inequalities on the PN markings. When the PN is supervised so that its markings satisfy these inequalities, the supervised net is proved to be deadlockfree for all initial(More)
This paper expands upon results of previous research dealing with the supervisory control of Petri net modeled discrete event systems that contain uncontrollable transitions. It represents the current state of progress, as well as recent results, in an ingoing research project in the area of Petri nets in discrete event system control. The concept of(More)
Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be deadlock-free for all(More)
An algorithm for constructing and training multilayer neural networks, dependence identification, is presented in this paper. Its distinctive features are that (i) it transforms the training problem into a set of quadratic optimization problems that are solved by a number of linear equations, (ii) it constructs an appropriate network to meet the training(More)
Deadlock is the condition of a system that has reached a state in which all of its potential actions are blocked. This paper introduces a deadlock prevention method for discrete events systems modeled by Petri nets. Petri nets have a bipartite graph structure and they are particularly well suited to model concurrencies found in manufacturing, communication(More)
Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the liveness enforcement procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be live for all initial(More)