Detection of Ada static deadlocks using Petri net invariants

Murata, Tadao; Shenker, B.; Shatz, Sol M.

doi:10.1109/32.21759

Cited by 138 publications

(40 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Modeling thread creation/termination and lock/unlock operations on shared data is in fact a classical application of Petri nets [21], and Petri nets have been employed to model multithreaded synchronization primitives in the popular Pthread library for C/C++ programs [22]. Petri nets were also used to analyze deadlocks in Ada programs [23]. A review of the application of Petri nets to computer programming is presented in [24].…”

Section: Gadara Methodologymentioning

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

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: Gadara Methodologymentioning

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

View full text Add to dashboard Cite

show abstract

“…A straightforward property of P-invariants is given by the following well-known result (Murata, 1989): If a vector y is a P-invariant of Petri net N = (P, T, A, M 0 ), then we have…”

Section: Petri Net Preliminariesmentioning

confidence: 99%

“…When an original Gadara net is augmented with the synthesized monitor places, we obtain the class of controlled Gadara nets, which are also defined. We first briefly review some Petri net preliminaries; see (Murata, 1989) for a detailed discussion.…”

Section: The Gadara Petri Net Modelmentioning

confidence: 99%

“…A review of the application of Petri nets to computer programming is presented in (Iordache and Antsaklis, 2009). Modeling thread creation/termination and mutex lock/unlock operations are in fact classical applications of Petri nets (Murata, 1989); in particular, Petri nets were used in (Murata et al, 1989) to analyze deadlocks in Ada programs. In the case of the popular Pthread library for C/C++ programs, Petri nets have also been employed to model multithreaded synchronization primitives (Kavi et al, 2002).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Concurrency bugs in multithreaded software: modeling and analysis using Petri nets

Liao

Yin

Cho

et al. 2012

Discrete Event Dyn Syst

View full text Add to dashboard Cite

In this paper, we apply discrete-event system techniques to model and analyze the execution of concurrent software. The problem of interest is deadlock avoidance in shared-memory multithreaded programs. We employ Petri nets to systematically model multithreaded programs with lock acquisition and release operations. We define a new class of Petri nets, called Gadara nets, that arises from this modeling process. We investigate a set of important properties of Gadara nets, such as liveness, reversibility, and linear separability. We propose efficient algorithms for the verification of liveness of Gadara nets, and report experimental results on their performance. We also present modeling examples of real-world programs. The results in this paper lay the foundations for the development of effective control synthesis algorithms for Gadara nets.

show abstract

“…Ada83 code analysis with Petri net techniques and particular with structural techniques like invariants or net reductions has been done by Murata and its team [MSS89], [TSM90], [NM94]. The use of ordinary Petri nets seems to us a major drawback of these works since it's very difficult with this formalism to express complex programming patterns.…”

Section: Related Workmentioning

confidence: 99%

Quasar: A New Tool for Concurrent Ada Programs Analysis

Évangelista

Kaiser

Pradat-Peyre

et al. 2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the concept of patterns. The analysis of a concurrent Ada program by our tool proceeds in four steps: automatic extraction of the concurrent part of the program; translation of the simplified program into a formal model using predefined patterns that are combined by substitution and merging constructors; analysis of the model both by structural techniques and model-checking techniques; reporting deadlock or starvation results. We demonstrate the usefulness of Quasar by analyzing several variations of a non trivial concurrent program.

show abstract

Detection of Ada static deadlocks using Petri net invariants

Cited by 138 publications

References 6 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

Concurrency bugs in multithreaded software: modeling and analysis using Petri nets

Quasar: A New Tool for Concurrent Ada Programs Analysis

Contact Info

Product

Resources

About