{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:10Z","timestamp":1725663130619},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100010"},{"type":"electronic","value":"9783540393221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10001-6_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:58:27Z","timestamp":1330189107000},"page":"165-212","source":"Crossref","is-referenced-by-count":30,"title":["Formal properties of place\/transition nets"],"prefix":"10.1007","author":[{"given":"M.","family":"Jantzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Valk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., Manders, K.: Computational Complexity of Decision Procedures for Polynomials. in:Conf.Proceedings of the 16-th IEEE Annual Symp. on Foundat. of Computer Sci., pp 169\u2013177, (1975).","DOI":"10.1109\/SFCS.1975.9"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(77)90059-7","volume":"4","author":"T. Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. Theoret. Comp. Sci., 4, pp 99\u2013119, (1977).","journal-title":"Theoret. Comp. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. S. Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-Bounded Multipushdown Machines. Journ. Comp. Syst. Sci., 8, pp 315\u2013332, (1974).","journal-title":"Journ. Comp. Syst. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/BF02196421","volume":"8","author":"A. P. Biryukov","year":"1967","unstructured":"Biryukov, A.P.: Some Algorithmic Problems for Finitely Defined Commutative Semigroups. Siberian Mathematics Journ., 8, pp 384\u2013391, (1967).","journal-title":"Siberian Mathematics Journ."},{"key":"3_CR5","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential Space Complete Problems for Petri Nets and Commutative Semigroups. in: Conf. Proc. of 8-th Annual ACM Symp. on Theory of Computing, pp 50\u201354, (1976)."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked Directed Graphs. Journ. Comp. Syst. Sci., 5, pp 511\u2013523, (1971).","journal-title":"Journ. Comp. Syst. Sci."},{"key":"3_CR7","unstructured":"Commoner, F.: Deadlocks in Petri Nets. Wakefield, Mass., Applied Data Research, Report CA-7206-2311, (1972)."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational Sets in Commutative Monoids. Journ. of Algebra, 13, pp 173\u2013191, (1969).","journal-title":"Journ. of Algebra"},{"key":"3_CR9","unstructured":"Genrich, H.J.: Einfache nicht-sequentielle Prozesse. GMD Bonn, ISF Bericht Nr. 37, (1971)."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00264027","volume":"2","author":"H. J. Genrich","year":"1973","unstructured":"Genrich, H.J., Lautenbach, K.: Synchronisationsgraphen. Acta Informatica, 2, pp 143\u2013161, (1973).","journal-title":"Acta Informatica"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger Formulas, and Languages. Pacific Journ. Math., 16, pp 285\u2013296, (1966).","journal-title":"Pacific Journ. Math."},{"key":"3_CR12","unstructured":"Griese, W.: Lebendigkeit in NSK-Petrinetzen. Techn. Univ. M\u00fcnchen, TUM-INFO-7906, (1979)."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1145\/322139.322152","volume":"26","author":"E. M. Gurari","year":"1979","unstructured":"Gurari, E.M., Ibarra, O.H.: An NP-Complete Number-Theoretic Problem. Journal. ACM, 26, pp 567\u2013581, (1979).","journal-title":"Journal. ACM"},{"key":"3_CR14","unstructured":"Hack, M.: Extended State-Machine Allocatable Nets, an Extension of Free Choice Petri Net Results. Cambridge, Mass., MIT, Project MAC, CSG-Memo 78-1, (1974)."},{"key":"3_CR15","volume-title":"Analysis of Production Schemata by Petri Nets","author":"M. Hack","year":"1972","unstructured":"Hack, M.: Analysis of Production Schemata by Petri Nets. Cambridge, Mass., MIT, Project MAC, MAC TR-94, (1972). Corrections to MAC TR-94: Comp. Struct. Note 17, (1974)."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Hack, M.: The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems. in: Conf. Proc. of the 15-th Annual IEEE Symp. on Switching and Automata Theory, pp 156\u2013164, (1974).","DOI":"10.1109\/SWAT.1974.28"},{"key":"3_CR17","unstructured":"Hack,M.: Petri Net Languages. Cambridge, Mass., MIT, Project MAC, Comp. Struct. Group Memo 124, (1975)."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(76)90008-6","volume":"2","author":"M. Hack","year":"1976","unstructured":"Hack, M.: The Equality Problem for Vector Addition Systems is Undecidable. Theoretical Comp. Sci., 2, pp 77\u201395, (1976).","journal-title":"Theoretical Comp. Sci."},{"key":"3_CR19","unstructured":"Holt,A.W.: Final Report for the Project \u2018Development of the Theoretical Foundations for Description and Analysis of Discrete Information Systems'. Wakefield, Mass., Applied Data Res., Report CADD-7405-2011, (1974)."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-Bounded Multicounter Machines and Their Decision Problems. Journ. ACM, 25, pp 116\u2013133, (1978).","journal-title":"Journ. ACM"},{"key":"3_CR21","unstructured":"Jaffe,J.M.: Semilinear Sets and Applications. Cambridge, Mass., MIT, Lab. for Comp. Sci., MIT\/LCS\/TR-183, (1977)."},{"key":"3_CR22","unstructured":"Jantzen,M.: Structured Representation of Knowledge by Nets as an Aid for Teaching and Research. in these Proceedings."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"N. D. Jones","year":"1977","unstructured":"Jones, N.D.,Landweber, L.H.,Lien, Y.E.: Complexity of Some Problems in Petri nets. Theoretical Comp. Sci., 4, pp 277\u2013299, (1977).","journal-title":"Theoretical Comp. Sci."},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. M. Karp","year":"1969","unstructured":"Karp, R.M.,Miller, R.E.: Parallel Program Schemata. Journ. Comp. Syst. Sci., 3, pp 147\u2013195, (1969).","journal-title":"Journ. Comp. Syst. Sci."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Sci.","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-07135-0_113","volume-title":"Parallel Processing","author":"R. M. Keller","year":"1975","unstructured":"Keller, R.M.: A Fundamental Theorem of Asynchronous Parallel Computation. in: Parallel Processing, Lecture Notes in Computer Sci., 24, pp 102\u2013112, Berlin: Springer, (1975)."},{"key":"3_CR26","unstructured":"Krieg,B.: Petrinetze und Zustandsgraphen. Univ. Hamburg, Fachbereich Informatik, Bericht Nr. IFI-HH-B-29\/77, (1977)."},{"key":"3_CR27","unstructured":"Krieg,B.: Petrinetze. Univ. Hamburg, Fachbereich Informatik, unpublished lecture notes, (1979)."},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"L. H. Landweber","year":"1978","unstructured":"Landweber, L.H.,Robertson, E.L.: Properties of Conflict Free and Persistent Petri Nets. Journ. ACM, 25, pp 352\u2013364, (1978).","journal-title":"Journ. ACM"},{"key":"3_CR29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/1977110100291","volume":"11","author":"M. Latteux","year":"1977","unstructured":"Latteux, M.: C\u00f4nes Rationnels Commutativement Clos. R.A.I.R.O., Informatique th\u00e9orique, 11, pp 29\u201351, (1977).","journal-title":"Informatique th\u00e9orique"},{"key":"3_CR30","unstructured":"Lautenbach,K.,Schmid,H.A.: Use of Petri Nets for Proving Correctness of Concurrent Process Systems. in: Information Processing 74, pp 187\u2013191, North-Holland Publ. Comp., (1974)."},{"key":"3_CR31","unstructured":"Lipton,R.J.: The Reachability Problem Requires Exponential Space. Yale Univ., Dept. of Comp. Sci., Research Report #62, (1976)."},{"key":"3_CR32","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0022-0000(70)80015-0","volume":"4","author":"L. Liu","year":"1970","unstructured":"Liu, L.,Weiner, P.: A Characterization of Semilinear Sets. Journ. Comp. Syst. Sci., 4, pp 299\u2013307, (1970).","journal-title":"Journ. Comp. Syst. Sci."},{"key":"3_CR33","first-page":"279","volume":"191","author":"Y. Matiyasevi\u010d","year":"1970","unstructured":"Matiyasevi\u010d, Y.: Enumerable Sets are Diophantine. (Russian), Dokl. Akad. Nauk, SSSR, 191, pp 279\u2013282, (1970). Translation in: Soviet Math. Doklady, 12, pp 249\u2013254, (1971).","journal-title":"Dokl. Akad. Nauk, SSSR"},{"key":"3_CR34","volume-title":"The Complexity of the Finite Containment Problem for Petri Nets","author":"E. W. Mayr","year":"1977","unstructured":"Mayr, E.W.: The Complexity of the Finite Containment Problem for Petri Nets. Cambridge, Mass., MIT, Lab. for Comp. Sci., MIT\/LCS\/TR-181, (1977)."},{"key":"3_CR35","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1051\/ita\/1978120201251","volume":"12","author":"G. Memmi","year":"1978","unstructured":"Memmi, G.: Fuites dans les R\u00e9seaux de Petri. R.A.I.R.O., Informatique Theorique, 12, pp 125\u2013144, (1978).","journal-title":"Informatique Theorique"},{"key":"3_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(76)80047-5","volume":"13","author":"J. L. Peterson","year":"1976","unstructured":"Peterson, J.L.: Computation Sequence Sets. Journ. Comp. Syst. Sci., 13, pp 1\u201324, (1976).","journal-title":"Journ. Comp. Syst. Sci."},{"key":"3_CR37","unstructured":"Petri,C.A.: Interpretations of Net Theory. GMD Bonn, Interner Bericht Nr. ISF-75-07, (1975)."},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Comp. Sci., 6, pp 223\u2013231, (1978).","journal-title":"Theoretical Comp. Sci."},{"key":"3_CR39","unstructured":"Thiet-Dung Huynh: On the Complexity of Semilinear Sets. Saarbr\u00fccken, Univ. des Saarlandes, Fachbereich Angewandte Mathematik und Informatik, Bericht Nr. A 79\/16, (1979)."},{"key":"3_CR40","unstructured":"Ullrich,G.: Der Entwurf von Steuerstrukturen f\u00fcr parallele Abl\u00e4ufe mit Hilfe von Petrinetzen. Univ. Hamburg, Fachbereich Informatik, Bericht Nr. IFI-HH-B-36\/77, (1977)."},{"key":"3_CR41","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-08138-0_27","volume":"48","author":"R. Valk","year":"1977","unstructured":"Valk, R.,Vidal-Naquet, G.: On the Rationality of Petri Net Languages. Lecture Notes in Comp. Sci., 48, pp 319\u2013328, (1977).","journal-title":"Lecture Notes in Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Net Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10001-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:32:57Z","timestamp":1619555577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10001-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100010","9783540393221"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/3-540-10001-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}