Lawrence E. Holloway

A Survey of Petri Net Methods for Controlled Discrete EventSystems

This paper surveys recent research on the application of Petri net models to the analysis and synthesis of controllers for discrete event systems. Petri nets have been used extensively in applications such as automated manufacturing, and there exists a large body of tools for qualitative and quantitative analysis of Petri nets. The goal of Petri net research in discrete event systems is to exploit the structural properties of Petri net models in computationally efficient algorithms for computing controls. We present an overview of the various models and problems formulated in the literature focusing on two particular models, the controlled Petri nets and the labeled nets. We describe two basic approaches for controller synthesis, based on state feedback and event feedback. We also discuss two efficient techniques for the on-line computation of the control law, namely the linear integer programming approach which takes advantage of the linear structure of the Petri net state transition equation, and path-based algorithms which take advantage of the graphical structure of Petri net models. Extensions to timed models are briefly described. The paper concludes with a discussion of directions for future research.

Synthesis of feedback control logic for a class of controlled Petri nets

An efficient solution is developed for a class of forbidden state problems for discrete event systems (DESs). DESs are considered which can be modeled as cyclic controlled marked graphs (CMGs), a special class of controlled Petri nets (CPNs). The distributed representation of the DES state in terms of the CMG marking permits an efficient specification of the forbidden states in terms of individual place markings. More important, it is shown that the graphical representations of the state transition logic in a CMG can be used to synthesize state feedback logic which is maximally permissive while guaranteeing the forbidden states will not occur. The practical application of the theoretical results is illustrated for an example of automated guided vehicle (AGV) coordination in a flexible manufacturing facility. >

Synthesis of feedback control logic for discrete manufacturing systems

Abstract This paper concerns the supervisory coordination and control of concurrent activity cycles in automated manufacturing facilities. In contrast to commonly used simulation models which integrate the control policy with the system model, the state transition logic for the manufacturing equipment is represented by a class of controlled Petri nets (CtlPN) with external inputs to be determined by the control synthesis algorithm. We formulate the forbidden state control problem in the CtlPN context and present an algorithm for generating maximally permissive controls which guarantee the system will avoid the forbidden states while permitting a maximal amount of flexibility in the system operation. The problem formulation and control synthesis algorithm is illustrated for an example of AGV co-ordination, and several classes of manufacturing control problems which can be addressed within this framework are identified.

Template languages for fault monitoring of timed discrete event processes

This paper introduces a new framework for modeling discrete event processes. This framework, called condition templates, allows the modeling of processes in which both single-instance and multiple-instance behaviors are exhibited concurrently. A single-instance behavior corresponds to a trace from a single finite-state process, and a multiple-instance behavior corresponds to the timed interleavings of an unspecified number of identical processes operating at the same time. The template framework allows the modeling of correct operation for systems consisting of concurrent mixtures of both single and multiple-instance behaviors. This representation can then be used in online fault monitoring for confirming the correct operation of a system. We compare the class of timed languages representable by template models with classes of timed languages from timed automata models. It is shown that templates are able to model timed languages corresponding to single and multiple-instance behaviors and combinations thereof. Templates can thus represent languages that could not be represented or monitored using timed automata alone.

A generalization of state avoidance policies for controlled Petri nets

This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law.

Time templates for discrete event fault monitoring in manufacturing systems

The input and output signals of automated manufacturing systems can be characterized as observed time functions of discrete events. Fault monitoring is the online analysis of the process observations to determine if they correspond to a specification of correct process operation. In this paper, we describe a new fault monitoring method, called template monitoring. Template monitoring overcomes several limitations associated with methods based on traditional discrete event process models. The template monitoring method is easily distributable, and is suitable for monitoring concurrent event relationships. We derive analytical results for generating templates from timed automaton models and describe the use of templates for real-time monitoring and diagnostics.

On closed-loop liveness of discrete-event systems under maximally permissive control

A class of controlled discrete-event systems modeled as controlled marked graphs (CMGs), a special case of controlled Petri nets, is considered. Liveness of controlled systems under maximally permissive feedback control policies is investigated. In the CMG context, closed-loop liveness implies that from any reachable marking (state) any transition can be enabled to fire. The concept of synchronic distances in Petri nets is used to prove sufficient conditions under which the maximally permissive control results in a live closed-loop system. >

Automated synthesis and composition of taskblocks for control of manufacturing systems

Automated control synthesis methods for discrete-event systems promise to reduce the time required to develop, debug, and modify control software. Such methods must be able to translate high-level control goals into detailed sequences of actuation and sensing signals. In this paper, we present such a technique. It relies on analysis of a system model, defined as a set of interacting components, each represented as a form of condition system Petri net. Control logic modules, called taskblocks, are synthesized from these individual models. These then interact hierarchically and sequentially to drive the system through specified control goals. The resulting controller is automatically converted to executable control code. The paper concludes with a discussion of a set of software tools developed to demonstrate the techniques on a small manufacturing system.

An overview of fault monitoring and diagnosis in mining equipment

Proper detection and diagnosis of failing system components is crucial to efficient mining operations. However, the harsh mining environment offers special challenges to these types of actions. The atmosphere is damp, dirty, and potentially explosive, and equipment is located in confined areas far from shop facilities. These conditions, coupled with the increasing cost of downtime and complexity of mining equipment, have forced researchers and operators to investigate alternatives for improving equipment maintainability. This paper surveys monitoring and diagnosis technologies that offer opportunities for improving equipment availability in mining. Expert systems, model-based approaches, and neural nets are each discussed in the context of fault detection and diagnosis. The paper concludes with a comparative discussion summarizing the advantages and disadvantages of each. >

Supervisory control of deterministic Petri nets with regular specification languages

Algorithms for computing a minimally restrictive control in the context of supervisory control of discrete-event systems have been well developed when both the plant and the desired behaviour are given as regular languages. In this paper the authors extend such prior results by presenting an algorithm for computing a minimally restrictive control when the plant behaviour is a deterministic Petri net language and the desired behaviour is a regular language. As part of the development of the algorithm, the authors establish the following results that are of independent interest: i) the problem of determining whether a given deterministic Petri net language is controllable with respect to another deterministic Petri net language is reducible to a reachability problem of Petri nets and ii) the problem of synthesizing the minimally restrictive supervisor so that the controlled system generates the supremal controllable sublanguage is reducible to a forbidden marking problem. In particular, the authors can directly identify the set of forbidden markings without having to construct any reachability tree.