Optimal Liveness-Enforcing Control for a Class of Petri Nets Arising in Multithreaded Software

Liao, Hai‐Bing; Lafortune, Stéphane; Reveliotis, Spyros; Wang, Yin; Mahlke, Scott

doi:10.1109/tac.2012.2230814

Cited by 24 publications

(28 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The general framework of this methodology, called ICOG for Iterative Control Of Gadara nets, is presented in [31], while its customization to the case of programs modeled by Gadara nets is presented in [32] and referred to as ICOG-O therein, since the nets involved remain ordinary throughout the iterations. This approach does not guarantee at the outset that the number of control places will be minimized.…”

Section: Control Logic Synthesismentioning

confidence: 99%

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Lafortune

Wang

Reveliotis

2013

Application and Theory of Petri Nets and Concurrency

Self Cite

View full text Add to dashboard Cite

Abstract. We describe the Gadara project, a research effort whose goal is to eliminate certain classes of concurrency bugs in multithreaded software by controlling the execution of programs at run-time. The Gadara process involves three stages: modeling of the source code at compile time in the form of a Petri net, feedback control synthesis, and control logic implementation into the source code. The feedback control logic is synthesized using techniques from supervisory control of discrete event systems, where the specification captures the avoidance of certain types of concurrency bugs, such as deadlocks. We focus on the case of circularwait deadlocks in multithreaded programs employing mutual exclusion locks for shared data. The application of the Gadara methodology to other classes of concurrency bugs is briefly discussed.

show abstract

Section: Control Logic Synthesismentioning

confidence: 99%

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Lafortune

Wang

Reveliotis

2013

Application and Theory of Petri Nets and Concurrency

Self Cite

View full text Add to dashboard Cite

show abstract

“…Moreover, Petri net models for some other application may also belong to the class of controlled Gadara nets and contain arcs with non-unit weights. In [18], we have developed a general methodology of optimal control synthesis for controlled Gadara nets that need not be ordinary. Technically, this proposed control methodology is also called a maximally-permissive liveness-enforcing (MPLE) control policy, since the synthesized control logic will provably eliminate deadlocks while otherwise minimally constraining program behavior, and the resulting controlled Gadara net is live.…”

Section: Introductionmentioning

confidence: 99%

“…The control synthesis algorithm proposed in [18] prevents a special type of siphons, termed Resource-Induced Deadly Marked (RIDM) siphons [28], from becoming reachable in the net. This algorithm possesses a very nice property that for any monitor place synthesized by the algorithm, its associated arcs always have unit weights.…”

Section: Introductionmentioning

confidence: 99%

“…As a result, if our control synthesis starts with a Gadara net model of a concurrent program, then the original net is ordinary, and the subsequent controlled nets will remain ordinary as well. This motivates us to investigate in this paper the customization of the general algorithm in [18], and concentrate on the ordinary case of controlled Gadara nets, where only resource-induced empty siphons need to be considered. A resource-induced empty siphon is a special case of a RIDM siphon.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

Liao

Wang

Stanley

et al. 2013

IEEE Trans. Contr. Syst. Technol.

Self Cite

View full text Add to dashboard Cite

Abstract-Computer hardware is moving from uniprocessor to multicore architectures. One problem arising in this evolution is that only parallel software can exploit the full performance potential of multicore architectures, and parallel software is far harder to write than conventional serial software. One important class of failures arising in parallel software is circularwait deadlock in multithreaded programs. In our on-going Gadara project, we use a special class of Petri nets, called Gadara nets, to systematically model multithreaded programs with lock allocation and release operations. In this paper, we propose an efficient optimal control synthesis methodology for ordinary Gadara nets that exploits the structural properties of Gadara nets via siphon analysis. Optimality in this context refers to the elimination of deadlocks in the program with minimally restrictive control logic. We formally establish a set of important properties of the proposed control synthesis methodology, and show that our algorithms never synthesize redundant control logic. We conduct experiments to evaluate the efficiency and scalability of the proposed methodology, and discuss the application of our results to real-world concurrent software.

show abstract

“…An EFSA, as presented in [8], is an extension of the ordinary FSA that associates each transition with a "guard" (conditional) formula and "action" functions, including different variables. In this kind of automaton, a transition is enabled iff the associated 6 For a particular RAS class where the PN modeling framework is provably capable of supporting the representation and computation of the maximally permissive DAP, the reader is referred to [30,31,32]. …”

mentioning

confidence: 99%

Deadlock avoidance policies for automated manufacturing cells

Reveliotis

Ferreira

Proceedings of 1995 American Control Conference - ACC'95

View full text Add to dashboard Cite

This chapter considers the problem of deadlock avoidance in flexibly automated manufacturing systems, one of the most prevalent supervisory control problems that challenges the effective deployment of these environments. The problem is addressed through the modeling abstraction of the (sequential) resource allocation system (RAS), and the pursued analysis uses concepts and results from the formal modeling framework of finite state automata (FSA). A notion of optimality is defined through the notion of maximal permissiveness, but the computation of the optimal DAP is shown to be NP-Hard. Hence, the last part of the chapter discusses some approaches that have been developed by the relevant research community in its effort to deal with this negative complexity result. IntroductionContemporary manufacturing is characterized by (i) an ever increasing emphasis on automation and by (ii) a quest for broader product lines and more customized product offerings [22].Indeed, since the beginning of the industrial revolution, automation has been at the core of the mass-production concept and practices, enabling activities and tasks that frequently transcend the human element in terms of capability, consistency, durability and speed [21]. More recently, automation has also been advocated as a key enabler for controlling the overall production cost, especially in economies where labor cost is particularly high. Hence, there is an increasing tendency to confine the presence of the human element on the production shop-floor to supervisory and maintenance tasks only, while the actual production activity is taken over by "intelligent" hardware, materialized in the form of numerically controlled (NC) machines, CHAPTER 6. 2 robots, and other material handling equipment. Clearly, enabling the reliable deployment of such an extensive mode of automation is a pretty challenging task. Yet, in the recent years, things have been further complicated, and the aforementioned challenges have been further exacerbated, by the second manufacturing trend mentioned above, i.e., the emphasis that is placed by the global markets upon choice and customization. This trend implies a need to support the production of a broader set of items, in smaller batch sizes, and with shorter life spans. Such demand and production patterns negate the economies of scale and the efficiencies of the dedicated production lines that have been sought by traditional manufacturing, and (re-)places the emphasis on concepts like resource sharing, flexibility, reconfigurability and concurrency [18]. But the current reality has also shown that the effective support of these concepts on the manufacturing shop-floor is highly non-trivial, and it adds an entirely new layer of complexity and challenges to the aforementioned endeavors towards the automated operation of production systems. The manufacturing world has become increasingly conscious of the fact that the successful design and deployment of flexibly automated production systems necessitates the development of a (ma...

show abstract

Optimal Liveness-Enforcing Control for a Class of Petri Nets Arising in Multithreaded Software

Cited by 24 publications

References 30 publications

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

Deadlock avoidance policies for automated manufacturing cells

Contact Info

Product

Resources

About