A compact Petri net representation for concurrent programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A compact Petri net representation for concurrent programs

Full text

Pdf (1.14 MB)

Source

International Conference on Software Engineering archive
Proceedings of the 17th international conference on Software engineering table of contents

Seattle, Washington, United States

Pages: 147 - 157

Year of Publication: 1995

ISBN:0-89791-708-1

Authors

Matthew B. Dwyer	Department of Computer Science, University of Massachusetts, Amherst
Lori A. Clarke	Department of Computer Science, University of Massachusetts, Amherst
Kari A. Nies	Dept. of Information & Computer Science, University of California, Irvine

Sponsors

IEEE-CS\TCSE : TC on Software Engineering
SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 22, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/225014.225028 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ABC+91	George S. Avrunin , Ugo A. Buy , James C. Corbett , Laura K. Dillon , Jack C. Wileden, Automated Analysis of Concurrent Systems with the Constrained Expression Toolset, IEEE Transactions on Software Engineering, v.17 n.11, p.1204-1222, November 1991 [doi>10.1109/32.106975]
	And91	Gregory R. Andrews, Paradigms for process interaction in distributed programs, ACM Computing Surveys (CSUR), v.23 n.1, p.49-90, March 1991 [doi>10.1145/103162.103164]
	BCM+90	J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking : 1020 states and beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428-439, 1990.
	CK93	Shing-Chi Cheung , Jeff Kramer, Tractable Flow Analysis for Anomaly Detection in Distributed Programs, Proceedings of the 4th European Software Engineering Conference on Software Engineering, p.283-300, September 13-17, 1993
	Cor94	James C. Corbett, An empirical evaluation of three methods for deadlock analysis of Ada tasking programs, Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, p.204-215, August 17-19, 1994, Seattle, Washington, United States [doi>10.1145/186258.187206]
	DBDS93	S. Duri , U. Buy , R. Devarapalli , S. M. Shatz, Using state space reduction methods for deadlock analysis in Ada tasking, ACM SIGSOFT Software Engineering Notes, v.18 n.3, p.51-60, July 1993
	DC94	Matthew B. Dwyer , Lori A. Clarke, Data flow analysis for verifying properties of concurrent programs, ACM SIGSOFT Software Engineering Notes, v.19 n.5, p.62-75, Dec. 1994
	DS91	Evelyn Duesterwald , Mary Lou Soffa, Concurrency analysis in the presence of procedures using a data-flow framework, Proceedings of the symposium on Testing, analysis, and verification, p.36-48, October 08-10, 1991, Victoria, British Columbia, Canada [doi>10.1145/120807.120811]
	For91	K. Forester. TIG-based Petri nets for modeling Ada tasking. Master's thesis, University of Massachusetts, Amherst, MA, June 1991.
	GW91	Patrice Godefroid , Pierre Wolper, Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, Proceedings of the 3rd International Workshop on Computer Aided Verification, p.332-342, July 01-04, 1991
	LC89	Douglas L. Long , Lori A. Clarke, Task interaction graphs for concurrency analysis, Proceedings of the 11th international conference on Software engineering, p.44-52, May 1989, Pittsburgh, Pennsylvania, United States [doi>10.1145/74587.74592]
	MR87	E. Timothy Morgan , Rami R. Razouk, Interactive state-space analysis of concurrent systems, IEEE Transactions on Software Engineering, v.13 n.10, p.1080-1091, October 1, 1987 [doi>10.1109/TSE.1987.232850]
	MR91	Stephen P. Masticola , Barbara G. Ryder, A model of Ada programs for static deadlock detection in polynomial times, Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging, p.97-107, May 20-21, 1991, Santa Cruz, California, United States
	Mur89	T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(44):541-580, April 1989.
	MZGT85	D. Mandrioli , R. Zicari , C. Ghezzi , F. Tisato, Modeling the ADA task system by Petri nets, Computer Languages, v.10 n.1, p.43-61, 1985 [doi>10.1016/0096-0551(85)90010-4]
	PTY92	M. Pezz&, R.N. Taylor, and M. Young. Graph models for reachability analysis of concurrent programs. Techmlical Report TR-92-27, Department of Information and Computer Science, University of California, Irvine, January 1992.
	Sha93	S.M. Shatz. Personal Communication, February 1993.
	SMBT90	S. M. Shatz , K. Mai , C. Black , S. Tu, Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis, IEEE Transactions on Parallel and Distributed Systems, v.1 n.4, p.424-441, October 1990 [doi>10.1109/71.80172]
	ST+94	S.M. Shatz, S. Tu, , T. Murata, and S. Duri. Theory and application of Petri net re-duction for Ada tasking deadlock analysis. Technical report, Department of Electrical Engineering and Computer Science, Univer-sit y of Illinois, Chicago, 1994.
	Tay83	Richard N. Taylor, A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM, v.26 n.5, p.361-376, May 1983 [doi>10.1145/69586.69587]
	YTL+92	M. Young, R.N. Taylor, D.L. Levine, K. Forester, and D. Brodbeck. A concurrency analysis tool suite: Raticmale, design, and preliminary experience. Technical Report TR-128-P, SERC, Purdue University, October 1992.
	YY91	Wei Jen Yeh , Michal Young, Compositional reachability analysis using process algebra, Proceedings of the symposium on Testing, analysis, and verification, p.49-59, October 08-10, 1991, Victoria, British Columbia, Canada [doi>10.1145/120807.120812]

CITED BY 6

	Matthew B. Dwyer , Lori A. Clarke, A flexible architecture for building data flow analyzers, Proceedings of the 18th international conference on Software engineering, p.554-564, March 25-29, 1996, Berlin, Germany
	A. T. Chamillard , Lori A. Clarke, Improving the accuracy of Petri net-based analysis of concurrent programs, ACM SIGSOFT Software Engineering Notes, v.21 n.3, p.24-38, May 1996
	Matthew B. Dwyer , Lori A. Clarke, A Compact Petri Net Representation and Its Implications for Analysis, IEEE Transactions on Software Engineering, v.22 n.11, p.794-811, November 1996
	Sol M. Shatz , Shengru Tu , Tadao Murata , Sastry Duri, An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis, IEEE Transactions on Parallel and Distributed Systems, v.7 n.12, p.1307-1322, December 1996
	Mauro Pezzè , Richard N. Taylor , Michal Young, Graph models for reachability analysis of concurrent programs, ACM Transactions on Software Engineering and Methodology (TOSEM), v.4 n.2, p.171-213, April 1995
	Baowen Xu , Ju Qian , Xiaofang Zhang , Zhongqiang Wu , Lin Chen, A brief survey of program slicing, ACM SIGSOFT Software Engineering Notes, v.30 n.2, March 2005