{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:48Z","timestamp":1725664488764},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:31:32Z","timestamp":1330295492000},"page":"111-122","source":"Crossref","is-referenced-by-count":10,"title":["Regularity is decidable for normed PA processes in polynomial time"],"prefix":"10.1007","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE 87, volume 259 of LNCS, pages 93\u2013114. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and W. P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"10_CR3","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":"10_CR4","doi-asserted-by":"crossref","unstructured":"O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR 96, volume 1119 of LNCS, pages 247\u2013262. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_59"},{"key":"10_CR5","unstructured":"D. Caucal. Graphes canoniques de graphes algebriques. Rapport de Recherche 872, INRIA, 1988."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR 93, volume 715 of LNCS, pages 143\u2013157. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, volume 630 of LNCS, pages 138\u2013147. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0084788"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"J. Esparza and P. Jan\u010dar. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP 96, volume 1099 of LNCS, pages 478\u2013489. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61440-0_152"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J. F. Groote","year":"1991","unstructured":"J. F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42:167\u2013171, 1991.","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings of LICS 91, pages 376\u2013386. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151661"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar. Decidability questions for bisimilarity of Petri nets and some related problems. In Proceedings of STACS 94, volume 775 of LNCS, pages 581\u2013592. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57785-8_173"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR 95, volume 962 of LNCS, pages 348\u2013362. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60218-6_26"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera. Deciding regularity in process algebras. BRICS Report Series RS-95-52, Department of Computer Science, University of Aarhus, October 1995.","DOI":"10.7146\/brics.v2i52.19953"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera. Regularity is decidable for normed PA processes in polynomial time. Technical report, Faculty of Informatics, Masaryk University, 1996.","DOI":"10.1007\/3-540-62034-6_42"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"S. Mauw and H. Mulder. Regularity of BPA-systems is decidable. In Proceedings of CONCUR 94, volume 836 of LNCS, pages 34\u201347. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_4"},{"key":"10_CR16","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5 th GI Conference, volume 104 of LNCS, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:35Z","timestamp":1605647495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}