Run-Time Detection of Tasking Deadlocks in Real-Time Systems with the Ada 95 Annex of Real-Time Systems

Cheng, Jingde

doi:10.1007/11767077_14

Cited by 5 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To solve the above problems, researchers gradually turn their attention to model-based deadlock control methods. One of the most common tools for modeling multithreaded software is Petri nets [3], [6], [9], [10], [13]. Petri nets are a powerful tool for investigating the supervisory control methods of discrete event systems [22].…”

Section: Introductionmentioning

confidence: 99%

A Deadlock Prevention Policy for a Class of Multithreaded Software

et al. 2020

View full text Add to dashboard Cite

Deadlock is an undesired situation in multithreaded software since it can lead to the stoppage of software. This paper studies the problem of deadlock control of multithreaded software based on Gadara nets, which are well studied for modelling concurrent programs. In particular, an iterative deadlock prevention policy based on siphons is proposed for a class of ordinary Gadara nets where the initial marking of each idle place is one. At each iteration, we compute emptiable siphons containing the smallest number of resource places. Then, bad markings are computed based on these siphons. On the basis of the bad markings, a constraint is constructed that forbids not only bad markings that empty one of the siphons but also some other bad markings. The algorithm is carried out until no emptiable siphon exists in the net. Compared with the existing methods, the resultant net derived from the proposed method is live and maximally permissive with a simpler supervisor. Finally, two examples are provided to illustrate the proposed deadlock prevention policy.

show abstract