1998
DOI: 10.1016/s0005-1098(98)00048-x
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of Deadlock and Circular Waits Using a Matrix Model for Flexible Manufacturing Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0
2

Year Published

2001
2001
2014
2014

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 93 publications
(38 citation statements)
references
References 0 publications
0
36
0
2
Order By: Relevance
“…Una espera circular simple (ECs) se denota como (r i →r j →r k →r p →r i ), donde los recursos necesarios para la espera deben ser al menos dos (ver Lewis, Gurel, Bogdan, Doganalp y Pastravanu, 1998). Para construir una política que utiliza las esperas circulares, se hace referencia a los teoremas propuestos por Huang et al (1996), Huang, Lewis y Tacconi (1996) y Lewis et al (1998), en donde se establece el concepto de sifones críti-cos (Sc) y se indica que limitando las tareas del sifón, se evita el bloqueo. A continuación los teoremas:…”
Section: Controlador Basado En Matricesunclassified
“…Una espera circular simple (ECs) se denota como (r i →r j →r k →r p →r i ), donde los recursos necesarios para la espera deben ser al menos dos (ver Lewis, Gurel, Bogdan, Doganalp y Pastravanu, 1998). Para construir una política que utiliza las esperas circulares, se hace referencia a los teoremas propuestos por Huang et al (1996), Huang, Lewis y Tacconi (1996) y Lewis et al (1998), en donde se establece el concepto de sifones críti-cos (Sc) y se indica que limitando las tareas del sifón, se evita el bloqueo. A continuación los teoremas:…”
Section: Controlador Basado En Matricesunclassified
“…It also provides a complete mathematical description of discrete event systems that can be used for the purpose of computer simulations. The matrix formulation suits well to implement deadlock avoidance policies [22], high-level planners, such as HTN planners [9], and dynamic resource assignment algorithms [8].…”
Section: A Literature Surveymentioning
confidence: 99%
“…Consequently, all the vectors and matrices related to variables associated to MOs can be obtained by simply stacking or concatenating the vectors or matrices defined for the individual areas. For instance, we can define the warehouse task vector (22) the warehouse input vector (23) the warehouse output vector (24) the warehouse logical vector (25) etc.…”
Section: Warehouse Global Modelmentioning
confidence: 99%
“…This makes the formal analysis of the model possible, thereby verifying the behavior of the underlying system, e.g., precedence relations among events, concurrent operations, appropriate synchronization, freedom from deadlock, repetitive activities, and mutual exclusion of shared resources. [3][4][5] The ability of PNs to verify formally the model is especially important for the real-time safety-critical automated systems.…”
Section: Petri Netmentioning
confidence: 99%