M. Young, R. Taylor, D. Levine, K. Forester, and D. Brodbeck, "A Concurrency Analysis Tool Suite: Rationale, Design, and Preliminary Experience," Technical Report, TR-128-P, Software Engineering Research Center, Purdue University, Oct. 1992.  Home/Search   Document Details and Download   Summary   Related Articles

....concurrency analysis research projects. These examples are especially relevant to this paper since they allow some quantitative comparison of our approach with another statespace oriented analysis technique, the modified (optimized) version of the Task Interaction Concurrent Graphs (TICG) method [32,33]. We assume that the reader is familiar with the dining philosopher problem. The program simulating n philosophers consists of 2n Ada tasks, one for each philosopher and one for each fork. Four versions of this program are discussed in [32,33] Version 1 is the classic dining philosopher problem ....

....of the Task Interaction Concurrent Graphs (TICG) method [32,33] We assume that the reader is familiar with the dining philosopher problem. The program simulating n philosophers consists of 2n Ada tasks, one for each philosopher and one for each fork. Four versions of this program are discussed in [32,33]. Version 1 is the classic dining philosopher problem without any deadlock avoidance. Table 2 shows some comparisons of the state space sizes for our fully reduced Ada net model and the published data for the modified TICG models [33] Note that with our fully reduced Ada net for this problem, the ....

[Article contains additional citation context not shown here]

M. Young, R. Taylor, D. Levine, K. Forester, and D. Brodbeck, "A Concurrency Analysis Tool Suite: Rationale, Design, and Preliminary Experience," Technical Report, TR-128-P, Software Engineering Research Center, Purdue University, Oct. 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC