Polynomial-Complexity Deadlock Avoidance Policy for Tasks Offloading in Satellite Edge Computing With Data-Dependent Constraints and Limited Buffers

Zhang, Ruipeng; Feng, Yanxiang; Yang, Yikang; Li, Xiaoling; Li, Hengnian

doi:10.1109/taes.2024.3409269

IEEE Trans. Aerosp. Electron. Syst.

2024

DOI: 10.1109/taes.2024.3409269

|View full text |Cite

Polynomial-Complexity Deadlock Avoidance Policy for Tasks Offloading in Satellite Edge Computing With Data-Dependent Constraints and Limited Buffers

Ruipeng Zhang,

Yanxiang Feng,

Yikang Yang

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On Deadlock Analysis and Characterization of Labeled Petri Nets with Undistinguishable and Unobservable Transitions

Zaghdoud,

2024

Mathematics

View full text Add to dashboard Cite

This work addresses the analysis and characterization of deadlocks in discrete-event systems modeled by labeled Petri nets (LPNs) with undistinguishable and unobservable transitions. To provide a solution for the notorious problem, it is essential to present an effective characterization in such a way that deadlock control and synthesis are technically and methodologically possible. To this end, we introduce the notion of dangerous implicit vectors (DIVs), which implicitly threaten the system deadlock-freedom. The set of dead markings is divided into two subsets: dead basis markings (DBMs) and dangerous implicit markings (DIMs). An algorithm is designed to compute the sets of DIVs and DIMs at a given basis state of a system. Moreover, by virtue of linear algebraic equations, we formulate sufficient conditions for identifying the existence of blocking markings in an LPN. Finally, an algorithm is developed to construct an observed graph that is a compendious presentation of the reachability graph of a net system, with respect to the existence of dead reaches. At the end of this paper, experiment results that illustrate the correctness and effectiveness of the reported solution are presented.

show abstract

On Deadlock Analysis and Characterization of Labeled Petri Nets with Undistinguishable and Unobservable Transitions

Zaghdoud,

2024

Mathematics

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Polynomial-Complexity Deadlock Avoidance Policy for Tasks Offloading in Satellite Edge Computing With Data-Dependent Constraints and Limited Buffers

Cited by 1 publication

References 43 publications

On Deadlock Analysis and Characterization of Labeled Petri Nets with Undistinguishable and Unobservable Transitions

On Deadlock Analysis and Characterization of Labeled Petri Nets with Undistinguishable and Unobservable Transitions

Contact Info

Product

Resources

About