{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T23:06:58Z","timestamp":1760828818091},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633884"},{"type":"electronic","value":"9783540695301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0014567","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T09:17:33Z","timestamp":1132737453000},"page":"547-561","source":"Crossref","is-referenced-by-count":11,"title":["Combining Petri nets and PA-processes"],"prefix":"10.1007","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, R. Echahed, and P. Habermehl. Verifying infinite state processes with sequential and parallel composition. In Proceedings of POPL'95, pages 95\u2013106. ACM Press, 1995.","DOI":"10.1145\/199448.199470"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"A. Bouajjani and P. Habermehl. Constrained properties, semilinear systems, and petri nets. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, number 1119 in LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_71"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, number 836 in LNCS, pages 98\u2013113. Springer Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_9"},{"key":"23_CR4","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In CAV'95, number 939 in LNCS, pages 353\u2013366. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60045-0_62"},{"key":"23_CR6","unstructured":"[Esp96] J. Esparza. More infinite results. In B. Steffen and T. Margaria, editors, Proceedings of INFINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85\u2013107, 1997.","journal-title":"Acta Informatica"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"A. Kucera. Regularity is decidable for normed pa processes in polynomial time. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), number 1180 in LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-62034-6_42"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"E. Mayr. An algorithm for the general petri net reachability problem. SIAM Journal of Computing, 13:441\u2013460, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Richard Mayr. Model checking pa-processes. Technical Report TUM-19640, TU-M\u00fcnchen, December 1996. To appear in CONCUR'97.","DOI":"10.1007\/3-540-63141-0_23"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Richard Mayr. Weak bisimulation and model checking for basic parallel processes. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), number 1I80 in LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-62034-6_40"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Richard Mayr. Tableau methods for pa-processes. In Analytic Tableaux and Related Methods (TABLEA UX'97), LNAL Springer Verlag, 1997. to appear.","DOI":"10.1007\/BFb0027420"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:47:28Z","timestamp":1586580448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633884","9783540695301"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0014567","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}