{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:31Z","timestamp":1725516031539},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708438"},{"type":"electronic","value":"9783540708445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70844-5_4","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T05:19:29Z","timestamp":1216703969000},"page":"33-35","source":"Crossref","is-referenced-by-count":0,"title":["Concurrency, Synchronization, and Conflicts in Petri Nets"],"prefix":"10.1007","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Baker, H.: Rabin\u2019s proof of the undecidability of the reachability set inclusion problem of vector addition systems, Computation Structures Group Memo 79, Project MAC, MIT (July 1973)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70881-0_1","volume-title":"Perspectives of Systems Informatics","author":"E. Best","year":"2007","unstructured":"Best, E., Esparza, J., Wimmel, H., Wolf, K.: Separability in conflict-free Petri nets. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol.\u00a04378, pp. 1\u201318. Springer, Heidelberg (2007)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Developments in Language Theory","author":"C. Campeanu","year":"2002","unstructured":"Campeanu, C., Salomaa, K., Vagvolgyi, S.: Shuffle quotient and decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 223\u2013226. Springer, Heidelberg (2002)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"V. Garg","year":"1992","unstructured":"Garg, V., Raghunath, M.: Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science\u00a096, 285\u2013304 (1992)","journal-title":"Theoretical Computer Science"},{"key":"4_CR5","unstructured":"Hack, M.: The equality problem for vector addition systems is undecidable. C.S.C. Memo 121, Project MAC, MIT (1975)"},{"issue":"2","key":"4_CR6","first-page":"257","volume":"8","author":"M. Ito","year":"2002","unstructured":"Ito, M.: Shuffle decomposition of regular languages. Journal of Universal Computer Science\u00a08(2), 257\u2013259 (2002)","journal-title":"Journal of Universal Computer Science"},{"key":"4_CR7","unstructured":"Lipton, R.: The reachability problem requires exponential space, Technical Report\u00a062, Yale University, Dept. of CS (January 1976)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"key":"4_CR9","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J. Peterson","year":"1981","unstructured":"Peterson, J.: Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs (1981)"},{"key":"4_CR10","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 Computer Science\u00a06, 223\u2013231 (1978)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer, New York (1985)"},{"issue":"8","key":"4_CR12","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/71.298217","volume":"5","author":"Y. Wolfsthal","year":"1994","unstructured":"Wolfsthal, Y., Yoeli, M.: An equivalence theorem for labeled marked graphs. IEEE Trans. on Parallel and Distributed Systems\u00a05(8), 886\u2013891 (1994)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"7","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1109\/TAC.2002.800664","volume":"47","author":"H. Yen","year":"2002","unstructured":"Yen, H.: Sequential versus concurrent languages of labeled conflict-free Petri nets. IEEE Trans. on Automatic Control\u00a047(7), 1158\u20131162 (2002)","journal-title":"IEEE Trans. on Automatic Control"},{"key":"4_CR14","unstructured":"Yen, H.: Introduction to Petri net theory. In: Esik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, ch.14, vol.\u00a025, pp. 343\u2013373 (2006)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Applications of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70844-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:30:17Z","timestamp":1620001817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70844-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708438","9783540708445"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70844-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}