Supervisory control of discrete event systems based on structure theory of Petri nets

Barkaoui, Kamel; Chaoui, Allaoua; Zouari, Belhassen

doi:10.1109/icsmc.1997.633253

Cited by 110 publications

(64 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A deadlock prevention which uses iterative siphon control method is described in (Iordache & Moody, 2000) and (Kezić, et al, 2006). Similar approaches can be found in (Barkaoui, et al 1997), (Barkaoui & Petrucci, 1988), (Tricias, et al 2000), (Tricas, et al, 2005). Deadlock prevention policy based on elementary siphons for FMS is proposed in (Mingming, et.…”

Section: Introductionmentioning

confidence: 88%

Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals

Kezić

Bogdan

Kasum

2012

ToMS

View full text Add to dashboard Cite

To avoid conflict and deadlock states in waterway with multiple locks and canals, a computer based traffic management system with proper control policy must be applied. The paper proposes a formal method for design of deadlock prevention supervisor by using discrete event theory, multiple reentrant flowlines class of Petri net and P-invariants control places calculation. By using and/or matrix algebra, authors analyze the structural characteristics of Petri net in order to find first and second level deadlocks. First level deadlocks are prevented by maintaining the number of vessels in the critical subsystems below the number of vessels in the critical circuits. A method for second level deadlock prevention, which is based on P-invariants, ensures that the key resources would not be the last available resources in the system. Functionality of the supervisor is verified by a computer simulation using Matlab software with Petri net toolbox and P-timed Petri net model of waterway.

show abstract

Section: Introductionmentioning

confidence: 88%

Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals

Kezić

Bogdan

Kasum

2012

ToMS

View full text Add to dashboard Cite

show abstract

“…Em malha fechada, a ação de controle do supervisor garante que o funcionamento do sistema esteja de acordo com uma especificação dada. Na TCS, segundo (Barkaoui et al, 1997) e (Cury, 2001), um SED é modelado por um par de linguagens, L e L m , bem definidas, mais o conjunto de eventos Σ. L representa o conjunto de todas as sequências de eventos que o sistema pode gerar a partir de seu estado inicial. L é fechada, ou seja L = L = {s ∈ Σ * : (∃t ∈ Σ * ) st ∈ L} e L m ⊆ L é a linguagem marcada que representa as tarefas completadas do sistema.…”

Section: O Controle Supervisóriounclassified

Restrições de controle sobre cores decompostas: uma proposta no controle supervisório de sistemas a eventos discretos utilizando redes de Petri coloridas

Menezes

Barroso

Prata

2012

Sba Controle & Automação

View full text Add to dashboard Cite

Control Restrictions on Decomposed Colors: An Approach for Supervisory Control of Discrete Event Systems Using Colored Petri Nets This paper presents the mathematical proof of the method for the synthesis of supervisors called Constraint of Control on Decomposed Colors, which is based on concepts of Supervisory Control Theory, using as main tool the coloured Petri nets to model systems discrete event, in order to find supervisors that meet those systems subject to constraints. By extension, it is proposed a method to reduce the number of controllers called Fusion of Controllers.

show abstract

“…Indeed, many results on RAS liveness and the synthesis of tractable liveness enforcing supervisors (LES) have been developed for the SU-RAS class, see, for example, [2,3] for seminal papers. Researchers have also addressed the problem in the context of the more general classes of D-RAS, C-RAS, and D/C-RAS, see [4,5] for early results. An interesting discussion that provides a unifying perspective for many of these results, and also highlights the currently prevailing issues in the area, can be found in [6].…”

Section: Journal Of Control Science and Engineeringmentioning

confidence: 99%

“…is a lower bound on the number of units of r i required to advance the kth subprocess from its place in P I to p k ; (4) given that the jth and kth subprocesses are both at their initial places in P I , max(…”

Section: Sufficient Condition Test For Quasi-liveness Of the A-rasmentioning

confidence: 99%

Process Completing Sequences for Resource Allocation Systems with Synchronization

Chew

Lawley

2012

Journal of Control Science and Engineering

View full text Add to dashboard Cite

This paper considers the problem of establishing live resource allocation in workflows with synchronization stages. Establishing live resource allocation in this class of systems is challenging since deciding whether a given level of resource capacities is sufficient to complete a single process is NP-complete. In this paper, we develop two necessary conditions and one sufficient condition that provide quickly computable tests for the existence of process completing sequences. The necessary conditions are based on the sequence of completions of n subprocesses that merge together at a synchronization. Although the worst case complexity is O(2 n ), we expect the number of subprocesses combined at any synchronization will be sufficiently small so that total computation time remains manageable. The sufficient condition uses a reduction scheme that computes a sufficient capacity level of each resource type to complete and merge all n subprocesses. The worst case complexity is O(n · m), where m is the number of synchronizations. Finally, the paper develops capacity bounds and polynomial methods for generating feasible resource allocation sequences for merging systems with single unit allocation. This method is based on single step look-ahead for deadly marked siphons and is O(2 n ). Throughout the paper, we use a class of Petri nets called Generalized Augmented Marked Graphs to represent our resource allocation systems.

show abstract

Supervisory control of discrete event systems based on structure theory of Petri nets

Cited by 110 publications

References 7 publications

Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals

Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals

Restrições de controle sobre cores decompostas: uma proposta no controle supervisório de sistemas a eventos discretos utilizando redes de Petri coloridas

Process Completing Sequences for Resource Allocation Systems with Synchronization

Contact Info

Product

Resources

About