{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:17:17Z","timestamp":1738387037377,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687450"},{"type":"electronic","value":"9783540687467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68746-7_19","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:54Z","timestamp":1217486274000},"page":"270-287","source":"Crossref","is-referenced-by-count":3,"title":["Labeled Step Sequences in Petri Nets"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Jantzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Petri nets and languages. C.S.G Memo 68, Project MAC","author":"H. Baker","year":"1972","unstructured":"Baker, H.: Petri nets and languages. C.S.G Memo 68, Project MAC. MIT, Cambridge (1972)"},{"key":"19_CR2","unstructured":"Burkhard, H.-D.: The Maximum Firing Strategie in Petri nets gives more power. ICS-PAS Report no. 411, Warschau, pp. 24\u201326 (1980)"},{"issue":"2\/3","key":"19_CR3","first-page":"71","volume":"17","author":"H.-D. Burkhard","year":"1981","unstructured":"Burkhard, H.-D.: Ordered Firing in Petri Nets. EIK\u00a017(2\/3), 71\u201386 (1981)","journal-title":"EIK"},{"issue":"2\/3","key":"19_CR4","first-page":"349","volume":"17","author":"H.-D. Burkhard","year":"1981","unstructured":"Burkhard, H.-D.: Two Pumping Lemmata for Petri Nets. EIK\u00a017(2\/3), 349\u2013362 (1981)","journal-title":"EIK"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-11981-7_5","volume-title":"Logics of Programs and Their Applications","author":"H.-D. Burkhard","year":"1983","unstructured":"Burkhard, H.-D.: On priorities of parallelism: Petri nets under the maximum firing strategy. In: Salwicki, A. (ed.) Logics of Programs and Their Applications. LNCS, vol.\u00a0148, pp. 86\u201397. Springer, Heidelberg (1983)"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1142\/2563","volume-title":"The book of traces","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The book of traces. World Scientific Publishing, Singapore (1995)"},{"issue":"3-4","key":"19_CR7","first-page":"303","volume":"79","author":"B. Farwer","year":"2007","unstructured":"Farwer, B., Kudlek, M., R\u00f6lke, H.: Concurrent turing machines. Fundamenta Informaticae\u00a079(3-4), 303\u2013317 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"19_CR8","unstructured":"Farwer, B., Jantzen, M., Kudlek, M., R\u00f6lke, H., Zetzsche, G.: On concurrent finite automata. In: Czaja, L. (ed.) Proceedings of the workshop Concurrency, Specification and Programming (CS&P 2007), \u0141ag\u00f3w, Poland, September 2007, vol.\u00a01, pp. 180\u2013190 (2007)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S. Greibach","year":"1978","unstructured":"Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science\u00a07, 311\u2013324 (1978)","journal-title":"Theoretical Computer Science"},{"key":"19_CR10","volume-title":"Petri Net Languages","author":"M. Hack","year":"1976","unstructured":"Hack, M.: Petri Net Languages, TR-159. MIT, Laboratory Computer Science, Cambridge, Mass (1976)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/BF01178731","volume":"31","author":"D. Hauschildt","year":"1994","unstructured":"Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrixgrammars. Acta Informatica\u00a031, 719\u2013728 (1994)","journal-title":"Acta Informatica"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","volume":"13","author":"M. Jantzen","year":"1979","unstructured":"Jantzen, M.: On the hierarchy of Petri net languages. R.A.I.R.O., Informatique Th\u00e9orique\u00a013, 19\u201330 (1979)","journal-title":"R.A.I.R.O., Informatique Th\u00e9orique"},{"key":"19_CR13","unstructured":"Jantzen, M., Kudlek, M., R\u00f6lke, H., Zetzsche, G.: Finite automata controlled by Petri nets. In: Proceedings of the 14th workshop; Algorithmen und Werkzeuge f\u00fcr Petrinetze (S.Philippi, A.Pini eds.) technical report Nr. 25\/2007, Univ. Koblenz-Landau, pp. 57\u201362 (2007)"},{"key":"19_CR14","unstructured":"Jantzen, M., Kudlek, M., Zetzsche, G.: On languages accepted by concurrent finite automata. In: Czaja, L. (ed.) Proceedings of the workshop Concurrency, Specification and Programming (CS&P 2007), \u0141ag\u00f3w, Poland, September 2007, vol.\u00a02, pp. 321\u2013332 (2007)"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FUN-2008-851-419","volume":"85","author":"M. Jantzen","year":"2008","unstructured":"Jantzen, M., Kudlek, M., Zetzsche, G.: Language classes defined by concurrent finite automata. Fundamenta Informaticae\u00a085, 1\u201314 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability of vector addition systems. In: 14th Annual ACM Symp. on Theory of Computing, San Francisco, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"19_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages, EATCS-Monographs on Theoretical Computer Science","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages, EATCS-Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Heidelberg, Berlin (1986)"},{"key":"19_CR18","unstructured":"Kudlek, M.: Sequentiality, Parallelism, and Maximality in Petri Nets. In: Farwer, B., Moldt, D. (eds.) Object Petri Nets, Processes, and Object Calculi, pp. 43\u201350 (2005); techn. report FBI-HH-B-265\/05"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J.L. Lambert","year":"1992","unstructured":"Lambert, J.L.: A structure to decide reachability in Petri nets. Theoretical Computer Science\u00a099, 79\u2013104 (1992)","journal-title":"Theoretical Computer Science"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. of Computing\u00a013, 441\u2013459 (1984)","journal-title":"SIAM J. of Computing"},{"issue":"4","key":"19_CR22","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1142\/S0129054192000231","volume":"3","author":"M. Mukund","year":"1992","unstructured":"Mukund, M.: Petri nets and step transition systems. Internat. J. of Foundations of Computer Science\u00a03(4), 443\u2013478 (1992)","journal-title":"Internat. J. of Foundations of Computer Science"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-60218-6_13","volume-title":"CONCUR \u201995 Concurrency Theory","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Priese, L., Sassone, V.: Characterizing Behavioural Congruences for Petri Nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 175\u2013189. Springer, Heidelberg (1995)"},{"key":"19_CR24","volume-title":"Computational complexity","author":"C..H. Papadimitriou.","year":"1949","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1949)"},{"key":"19_CR25","unstructured":"Peterson, J.L.: Petri Nets and the Modelling of Systems. MIT Press Series in Computer Science (1981)"},{"key":"19_CR26","unstructured":"Reischuk, K.R.: Komplexit\u00e4tstheorie. In: Teubner, B.G. (ed.) Band I: Grundlagen, Stuttgart, Leipzig (1999)"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-11160-3_6","volume-title":"Proceedings of the internat. Workshop: Logic of Programs, 1979, Z\u00fcrich","author":"A. Salwicki","year":"1981","unstructured":"Salwicki, A., M\u00fcldner, T.: On the algorithmic properties of concurrent programs. In: Engeler, E. (ed.) Proceedings of the internat. Workshop: Logic of Programs, 1979, Z\u00fcrich. LNCS, vol.\u00a0125, pp. 169\u2013197. Springer, Heidelberg (1981)"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/322047.322061","volume":"25","author":"J. Seiferas","year":"1978","unstructured":"Seiferas, J., Fischer, M., Meyer, A.: Separating Nondeterministic Time Complexity Classes. J. ACM\u00a025, 146\u2013167 (1978)","journal-title":"J. ACM"},{"key":"19_CR29","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0304-3975(83)90015-4","volume":"26","author":"S. Zak","year":"1983","unstructured":"Zak, S.: A TM Time Hierarchy. Theoretical Computer Science\u00a026, 327\u2013333 (1983)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68746-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:22:19Z","timestamp":1738308139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68746-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540687450","9783540687467"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68746-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}