{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:14Z","timestamp":1762458854834},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206323"},{"type":"electronic","value":"9783540409656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40965-6_12","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:52:14Z","timestamp":1294397534000},"page":"173-187","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical Structure of 1-Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Kamal","family":"Lodaya","sequence":"first","affiliation":[]},{"given":"D.","family":"Ranganayakulu","sequence":"additional","affiliation":[]},{"given":"K.","family":"Rangarajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04457-5","volume-title":"Petri net algebra","author":"E. Best","year":"2001","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri net algebra. Springer, Heidelberg (2001)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-44988-4_6","volume-title":"Application and Theory of Petri Nets 2000","author":"E. Best","year":"2000","unstructured":"Best, E., Wimmel, H.: Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 63\u201382. Springer, Heidelberg (2000)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90095-Y","volume":"75","author":"P. Degano","year":"1990","unstructured":"Degano, P., de Nicola, R., Montanari, U.: A partial order semantics for CCS. TCS\u00a075, 223\u2013262 (1990)","journal-title":"TCS"},{"volume-title":"The book of traces","year":"1995","key":"12_CR4","unstructured":"Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific, Singapore (1995)"},{"key":"12_CR5","first-page":"23","volume":"30","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fund. Inf.\u00a030, 23\u201341 (1997)","journal-title":"Fund. Inf."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"V.K. Garg","year":"1992","unstructured":"Garg, V.K., Ragunath, M.T.: Concurrent regular expressions and their relationship to Petri nets. TCS\u00a096, 285\u2013304 (1992)","journal-title":"TCS"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. TCS\u00a061, 199\u2013224 (1988)","journal-title":"TCS"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R.J. Glabbeek van","year":"1987","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 224\u2013242. Springer, Heidelberg (1987)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-13345-3_18","volume-title":"Automata, Languages, and Programming","author":"U. Goltz","year":"1984","unstructured":"Goltz, U., Mycroft, A.: On representing CCS programs by finite Petri nets. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 196\u2013208. Springer, Heidelberg (1984)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Grabowski, J.: On partial languages. Fund. Inform.\u00a0IV, 427\u2013498 (1981)","DOI":"10.3233\/FI-1981-4210"},{"key":"12_CR11","unstructured":"Hack, M.H.T.: Analysis of production schemata by Petri nets, M.S. thesis, Dept. Elec. Engg., MIT (1972)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(02)00370-5","volume":"299","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Towards a language theory for infinite N-free posets. TCS\u00a0299, 347\u2013386 (2003)","journal-title":"TCS"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. TCS\u00a0237, 347\u2013380 (2000)","journal-title":"TCS"},{"key":"12_CR14","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"Ochma\u0144ski, E.: Regular behaviour of concurrent systems, Bull. EATCS\u00a027, 56\u201367 (1985)","journal-title":"EATCS"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Olderog, E.-R.: Nets, terms and formulas, Cambridge (1991)","DOI":"10.1017\/CBO9780511526589"},{"key":"12_CR16","first-page":"386","volume-title":"Proc. IFIP","author":"C.-A. Petri","year":"1962","unstructured":"Petri, C.-A.: Fundamentals of a theory of asynchronous information flow. In: Popplewell, C.M. (ed.) Proc. IFIP, M\u00fcnich, pp. 386\u2013390. North-Holland, Amsterdam (1962)"},{"issue":"1","key":"12_CR17","first-page":"33","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modelling concurrency with partial orders. IJPP\u00a015(1), 33\u201371 (1986)","journal-title":"IJPP"},{"key":"12_CR18","unstructured":"Ranganayakulu, D., Lodaya, K.: Infinite series-parallel posets of 1-safe nets. In: Thangavel, P. (ed.) Proc. Algorithms & Artificial Systems, Allied, pp. 107\u2013124 (2003)"},{"key":"12_CR19","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, Heidelberg (1985)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-51525-9","volume-title":"Finite Representations of CCS and TCSP Programs by Automata and Petri Nets","author":"D. Taubner","year":"1989","unstructured":"Taubner, D.: Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. LNCS, vol.\u00a0369. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40965-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T21:39:06Z","timestamp":1637098746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40965-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206323","9783540409656"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40965-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}