Supervisory Control of Partially Observable Marked Graphs

Achour, Zied; Rezg, Nidhal; Xie, Xiaolan

doi:10.1109/tac.2004.837558

Cited by 16 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The control of live marked graphs under partial observability is considered also by Achour et al (2004), for specifications (1) and the same partition T = T c ∪ T f ∪ T i , where T o = T c ∪ T f are the observable transitions. The paper extends the previous work of Ghaffari et al (2003b) to account for unobservable transitions.…”

Section: Methods For Partial Observabilitymentioning

confidence: 99%

Supervision Based on Place Invariants: A Survey

Iordache

Antsaklis

2006

Discrete Event Dyn Syst

108

View full text Add to dashboard Cite

The supervision based on place invariants (SBPI) is an efficient technique for the supervisory control of Petri nets. This paper reveals the significance of the SBPI based on a literature survey, applications, and an analysis of problems and supervisory settings that can be addressed using SBPI. Special attention is given to the various settings within which the problem can be formulated. Such settings can be distinguished based on the concurrency type, the type of controllability and observability, and the centralized or decentralized type of supervision. As we show, it is possible to approach the most general settings in a purely structural way, without resorting to reachability analysis. We begin by describing the SBPI problem and the literature methods that address this problem or are related to it. Then, we proceed to show classes of problems that can be reduced to the SBPI problem. In the SBPI, the specification is described as a system of inequalities that the Petri net marking must satisfy at any time. However, as we show, problems involving more general specifications can be approached in the SBPI setting, sometimes under additional assumptions, by performing net and/or specification transformations. Four of the specifications we will consider are logic constraints, language specifications, disjunctions of linear constraints, and liveness. We conclude with a presentation of possible applications of the SBPI approach to programming with semaphores, fault tolerance, and synchronic-distance based designs.

show abstract

Section: Methods For Partial Observabilitymentioning

confidence: 99%

Supervision Based on Place Invariants: A Survey

Iordache

Antsaklis

2006

Discrete Event Dyn Syst

108

View full text Add to dashboard Cite

show abstract

“…in [39,15,1,30]. In [15,1,30], the ring of each observable transition generates a unique label and the rings of unobservable transitions go unrecorded, whereas [39] considers the more general case where multiple observable transitions are allowed to share the same label.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The contributions of this paper include the following: i) partially observed and partially controlled Petri nets with general labeling functions are used in supervisor synthesis; in contrast to previous work in [15,1,30], the separation between observation and control (in the sense More specically, this assumption requires the so-called precedence path input condition; for details, refer to Denition 4 and Theorem 3 in [39].…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Supervisor synthesis for discrete event systems under partial observation and arbitrary forbidden state specifications

Cabasino

Giua

et al. 2012

Discrete Event Dyn Syst

View full text Add to dashboard Cite

In this paper, we consider the forbidden state problem in discrete event systems modeled by partially observed and partially controlled Petri nets. Assuming that the reverse net of the uncontrollable subnet of the Petri net is structurally bounded, we compute a set of weakly forbidden markings from which forbidden markings can be reached by ring a sequence of uncontrollable/unobservable transitions. We then use reduced consistent markings to represent the set of consistent markings for Petri nets with structurally bounded unobservable subnets. We determine the control policy by checking if the ring of a certain controllable transition will lead to a subsequent reduced consistent marking that belongs to the set of weakly forbidden markings; if so, we disable the corresponding controllable transition. This approach is shown to be minimally restrictive in the sense that it only disables behavior that can potentially lead to a forbidden marking. The setting in this paper generalizes previous work by studying supervisory control for partially observed and partially controlled Petri nets with a general labeling function and a nite number of arbitrary forbidden states. In contrast, most previous work focuses on either labeling functions that assign a unique label to each observable transition or forbidden states that are represented using linear inequalities. More importantly, we demonstrate that, in general, the separation between observation and control (as considered in previous work) may not hold in our setting.

show abstract

“…In addition, a method to solve the FSP for live bounded marked graphs with uncontrollable transitions using General Mutual Exclusion Constraints (GMEC) is introduced in (Ghaffari et al, 2003). The case of unobservable transitions is considered in (Achour et al 2004) and the existence of a maximally permissive PN controller for the FSP of bounded PN under partial observation is treated in (Achour et al, 2005). Based on the supervisory theory of (Ramadge and Wonham, 1987), Lee et al (2006) have proposed an algorithm for elaborating constraint synchronous reachability graph and calculating forbidden and authorised sequences.…”

Section: Introductionmentioning

confidence: 99%