Properties of Conflict-Free and Persistent Petri Nets

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Properties of Conflict-Free and Persistent Petri Nets

Full text

Pdf (872 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 3 (July 1978) table of contents

Pages: 352 - 364

Year of Publication: 1978

ISSN:0004-5411

Authors

L. H. Landweber	Computer Sciences Department, University of Wisconsin-Madison, Madison, WI
E. L. Robertson	Computer Science Department, The Pennsylvania State University, University Park, PA

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/322077.322079 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.

	1	CRESPI-REGHIZZI, S, AND MANDRIOLI, D A dec~dablhty theorem for a class of vector-addmon systems Inf Proc Letters 3 (1975), 78-80
	2	HACK, M The recursive equivalence of the, reachablhty problem and the hveness problem for Petn nets and vector addmon systems Proc 15th Annual IEEE Symp on SwltcMng and Automata Theory, 1974, pp 156-164
	3	HACK, M Dectdabdlty questions for Petn nets Ph D Th, M I T, Cambridge, Mass, Dec 1975
	4	JONES, N, LANDWEBER, L H, AND LIEN, Y E Complexity of some Petn net problems Theoret Comptr Sct 4 (1977), 277-299
	5	KARP, R M, AND MILLER, R E Parallel program schemata J Comptr Syst Sct 3 (1969), 147-195.
	6	Robert M. Keller, A Fundamental Tehoerem of Asynchronous Parallel Computation, Proceedings of the Sagamore Computer Conference on Parallel Processing, p.102-112, August 20-23, 1974
	7	LIPTON, R J The reachablhty problem and the boundedness problem for Petn nets are exponential-space hard Conf on Petn Nets & Related Methods, M I T, July 1975, also Comptr. ScL Res Rep. #62, Yale U, New Haven, Corm
	8	LIPTOn, R J, MILLER, R E, AND SNYDER., L Synchromzauon and computing capabdmes of lmear asynchronous structures J Comptr. Syst. Sc~ 14, 1 (Jan 1977), 49-72
	9	MULLER, D.E, AND BANTKY, M.S. A theory of asynchronous c~rcuits Proc Int Symp on Theory of Switching, Harvard U. Press, Cambridge, Mass, 1959, pp. 204-243.
	10	Rohit J. Parikh, On Context-Free Languages, Journal of the ACM (JACM), v.13 n.4, p.570-581, Oct. 1966 [doi>10.1145/321356.321364]
	11	PETRi, C A Fundamentals of a theory of asynchronous information flow Proc IFIP Conf Mumch, 1962, pp 166-168
	12	RACKOFF, C The covermg and boundedness problems for vector addmon systems Tech Pep No 97, Dept of Comptr Scl, U of Toronto, Toronto, Canada, July 1976
	13	Jan van Leeuwen, A partial solution to the reachability-problem for vector-addition systems, Proceedings of the sixth annual ACM symposium on Theory of computing, p.303-309, April 30-May 02, 1974, Seattle, Washington, United States [doi>10.1145/800119.803908]

CITED BY 4

	Ph. Darondeau, Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets, Information Processing Letters, v.94 n.6, p.241-245, 30 June 2005
	Hsu-Chun Yen , Lien-Po Yu, Decidability analysis of self-stabilization for infinite-state systems, Fundamenta Informaticae, v.70 n.4, p.387-402, April 2006
	Eike Best , Philippe Darondeau , Harro Wimmel, Making Petri Nets Safe and Free of Internal Transitions, Fundamenta Informaticae, v.80 n.1-3, p.75-90, January 2007
	Kamila Barylska , Edward Ochma´nski, Levels of Persistency in Place/Transition Nets, Fundamenta Informaticae, v.93 n.1-3, p.33-43, January 2009