On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems

Reveliotis, Spyros

doi:10.1007/3-540-44919-1_17

Cited by 49 publications

(22 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…15 Next we present another criterion that is weaker than the criterion of Corollary 3, but it connects the presented results to those originally derived in [9]. Furthermore, this new criterion can be simpler, from a computational standpoint.…”

Section: Explaining the Functionality Of Algebraic Dapsmentioning

confidence: 61%

Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Reveliotis

2007

Engineering and Management Innovation

View full text Add to dashboard Cite

As many contemporary technological applications move to operational modes of more extensive and flexible automation, there is a rising need to design and control the underlying resource allocation not only for efficiency, but also for logical correctness and internal consistency. The material presented in this chapter offers a unifying and comprehensive treatment of a class of policies that have been proposed as an effective and efficient solution to this emerging class of logical control problems.

show abstract

Section: Explaining the Functionality Of Algebraic Dapsmentioning

confidence: 61%

Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Reveliotis

2007

Engineering and Management Innovation

View full text Add to dashboard Cite

show abstract

“…In addition, the possession of these two properties by a process-resource net of this class, is contingent upon the absence of certain types of insufficiently marked siphons from its reachability space. For the particular case of ES 3 P R nets, the following result is a direct implication of Corollary 3 and Theorem 2 in [7]:…”

Section: Item 3 Of Definition 5 Expresses the Conservative -Ormentioning

confidence: 76%

“…Process-resource nets have been extensively used in the literature for modelling the contest of concurrently executing processes for a finite set of reusable resources; some general characterizations of these nets and extensive studies of their properties can be found in [4], [7], [10]. Generally speaking, these nets are obtained by merging a set of sub-nets modelling the sequential logic and the resource allocation associated with the execution of their process types, through the places modelling the availability of the shared resources.…”

Section: Process-resource Nets and Their Esmentioning

confidence: 99%

“…It has been shown [4], [7] that, for a large class of processresource nets, the net reversibility is a concept equivalent to the net liveness. In addition, the possession of these two properties by a process-resource net of this class, is contingent upon the absence of certain types of insufficiently marked siphons from its reachability space.…”

Section: Item 3 Of Definition 5 Expresses the Conservative -Ormentioning

confidence: 99%

“…The role and the significance of the structural object of siphon for the deadlock and liveness analysis of many Petri net (PN) classes are well-documented in the relevant literature, e.g., [1], [2], [3], [4], [5], [6], [7]. Generally speaking, the development of deadlock markings in any PN system, as well as the non-liveness of a considerable number of PN sub-classes, can be attributed to the insufficient marking of some of the system siphons.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Implicit Siphon Control and Its Role in the Liveness-Enforcing Supervision of Sequential Resource Allocation Systems

Reveliotis

2007

IEEE Trans. Syst., Man, Cybern. A

Self Cite

View full text Add to dashboard Cite

Abstract-The work presented in this paper seeks (i) to correct and generalize some previously published results regarding the siphon control in PT-ordinary Petri nets, and subsequently (ii) to employ this generalized framework in order to provide an alternative explanation of the way in which certain methodologies, that have been proposed in the past, enforce the liveness of a particular class of PT-ordinary Petri nets modelling resource allocation. The derived characterizations provide a unifying framework for analyzing and interpreting the aforementioned methodologies, and also they reveal that approaches that have been considered as disparate in the current literature, can actually be "mixed" towards the development of an ever richer set of liveness enforcing supervisory control policies for the considered class of Petri nets.Index Terms-sequential resource allocation systems, system design and verification using Petri nets, deadlock resolution and liveness enforcing supervision

show abstract

Logical Control of Disjunctive / Conjunctive Resource Allocation Systems

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems

Cited by 49 publications

References 12 publications

Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Implicit Siphon Control and Its Role in the Liveness-Enforcing Supervision of Sequential Resource Allocation Systems

Logical Control of Disjunctive / Conjunctive Resource Allocation Systems

Contact Info

Product

Resources

About