Matthew B. Dwyer, Lori. A. Clarke, and Kari L. Nies. A compact petri net representation for concurrent programs. In Proceedings of the 17th International Conference on Software Engineering, pages 147--157, April 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....time. 136 How to handle tasking deadlocks in concurrent Ada programs is an indispensable issue in any system with Ada tasking. In the last decade, a number of papers dealt with the tasking deadlock problem in Ada 83 programs and proposed various methods and tools to detect tasking deadlocks [4 6,8,9,11 13]. These methods and tools can be classified into two categories: static detection methods and dynamic detection methods. Unfortunately, none of those tasking deadlock detection methods proposed over the last decade can satisfy all three of the above basic requirements completely. From the ....

Dwyer, M.B., Clarke, L.A., Nies, K.A..: A Compact Petri Net Representation for Concurrent Programs, Proc. IEEE-CS & ACM 17th International Conference on Software Engineering (1995) 147-157

....function mapping places in P to outputs of transitions in T. M0 is a list of all the places in the net that are initially marked. Petri net modeling appears to be a valuable tool for modeling concurrent software [SC88] a compact Petri net representation can be generated from the TIGs of a program [DCN94]. To generate the Petri net, we build a place for each node in the set of TIGs of a program. We build a transition for each possible interaction between tasks in the program, where the input places correspond to the sources of the matching entry call and accept TIG edges, and the output places ....

Matthew B. Dwyer, Lori A. Clarke, and Kari A. Nies. A compact petri net representation for concurrent programs. Technical Report TR 94-46, University of Massachusetts, Amherst, 1994.

....rich model independent of any specific analysis issue, and then manipulating this model with algorithms that are designed for the specific analysis issue of concern. Recently, Dwyer, et al. presented a compact Petri net representation for concurrent programs that is based on the TIG model [17]. Standard deadlock preserving Petri net reduction techniques cannot be applied to these nets, but some forms of deadlock preserving reductions that are applicable to these nets are suggested. Some analysis methods that have shown particular promise in handling reasonably large examples include ....

M. B. Dwyer, L. A. Clarke, and K. A. Nies, "A Compact Petri Net Representation for Concurrent Programs," Proceedings of the 17th International Conf. on Software Engineering, April, 1995, pp. 147-157.

....interest by considering all reachable states of the program being analyzed; this approach is commonly called reachability analysis. The set of reachable program states can be estimated using a variety of program representations, including flow graphs [Tay83a, YTL 92] and Petri nets [Pet77, SC88, DCN94] Theoretical results [Tay83b] imply that, in general, the time and space requirements for this technique are exponential. Methods proposed for improving accuracy of reachability analysis include combining reachability analysis with symbolic execution [YT88] and using program variable value ....

....a list of all the places in the net that are initially marked. Petri net modeling appears to be a valuable tool for modeling concurrent software [SC88] A Petri net can be generated directly from the control flow graphs of a given program. We can also build a Petri net from the TIGs of a program [DCN94] with the resulting Petri net called a TIG based Petri Net (TPN) To generate the TPN, we build a place for each node in the set of TIGs of a program. We build a transition for each possible interaction between tasks in the program, where the input places correspond to the sources of the ....

[Article contains additional citation context not shown here]

Matthew B. Dwyer, Lori A. Clarke, and Kari A. Nies. A compact petri net representation for concurrent programs. Technical Report TR 94-46, University of Massachusetts, Amherst, 1994.

....a particular program execution state as defined by a TFG node. MayDiffer(x, y) returns false if x = y or if one value is Both and the other is Unknown, otherwise it returns true. We have prototyped a data flow analyzer that is capable of finding dead transitions in a TIG based Petri Net (TPN) DCN95] The problem is formulated over the set of TPN transitions. The lattice is a bit vector encoding of the set of transitions. The function space consists of a distinct function for each TPN transition; each function tests if any predecessor has its bit set in the input value, and if so, adds the ....

Matthew B. Dwyer, Lori. A. Clarke, and Kari L. Nies. A compact petri net representation for concurrent programs. In Proceedings of the 17th International Conference on Software Engineering, pages 147--157, April 1995.

....studied representation that is well suited for modeling concurrent systems. Petri nets are bipartite graphs with node kinds called places and transitions. For the purpose of representing concurrent programs, places represent components of state information and transitions represent system events [25, 69]. Petri nets have a well defined execution semantics. The state of the net is represented by a marking, i.e. an indication of the number of tokens contained in each place. A transition fires when all of its input places have tokens and produces tokens for its output places. We can construct Petri ....

....on a CPA that incorporates a boolean variable automaton. An interesting empirical question is how does the cost of qualified analysis versus CPAbased analysis compare . 211 We have prototyped a data flow analyzer that is capable of finding dead transitions in a TIG based Petri Net (TPN) [25]. The problem is formulated over the set of TPN transitions. The lattice is a bit vector encoding of the set of transitions. The function space consists of a distinct function for each TPN transition; each function tests if any predecessor has its bit set in the input value, and if so, adds the ....

Dwyer, M.B., Clarke, L.A., and Nies, K.L. A compact petri net representation for concurrent programs. In Proceedings of the 17th International Conference on Software Engineering, April 1995.

....work using an alternative Petri net representation for Ada programs. Our empirical data suggests that the TPN representation offers reduced analysis cost and enables reachability analysis for larger programs than previously proposed property independent techniques. Building on our initial work [DCN95] we have also 3 been able to adapt some property specific Petri net reduction techniques into property independent TPN reduction techniques, with the potential to further improve performance. In the following section, we briefly overview the major approaches to concurrency analysis. Section 3 ....

....Thus, this sequence of reduction steps has yielded a more efficient analysis with the same precision as an unreduced analysis. 6.5 Discussion A number of interesting observations can be made about our adaptation of Petri net reductions so as to make them property independent. In earlier work [DCN95] we describe a complex deadlock freedom preserving TPN reduction called forced communication pairs. Using a series of serial place and parallel place reductions we can produce a propertyindependent version of the forced communication pair reduction. 28 The net reductions are intended to produce ....

M.B. Dwyer, L.A. Clarke, and K.L. Nies. A compact petri net representation for concurrent programs. In Proceedings of the 17th International Conference on Software Engineering, pages 147--158, April 1995.

....particular program execution state as defined by a TFG node. MayDiffer(x, y) returns false if x = y or if one value is Both and the other is Unknown, otherwise it returns true. We have also prototyped a data flow analyzer that is capable of finding dead transitions in a TIG based Petri Net (TPN) [10]. The problem is formulated over the set of TPN transitions. The lattice is a bit vector encoding of the set of transitions. The function space consists of a distinct function for each TPN transition; each function tests if any predecessor has its bit set in the input value, and if so, adds the ....

Matthew B. Dwyer, Lori. A. Clarke, and Kari L. Nies. A compact petri net representation for concurrent programs. In Proceedings of the 17th International Conference on Software Engineering, pages 147--157, April 1995.

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