{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:23:58Z","timestamp":1760016238139},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:25Z","timestamp":1330279045000},"page":"221-232","source":"Crossref","is-referenced-by-count":21,"title":["Petri nets, commutative context-free grammars, and basic parallel processes"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"17_CR1","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. Ph.D. Thesis, University of Edinburgh, CST-105-93, (1993)."},{"key":"17_CR2","first-page":"138","volume":"630","author":"S. Christensen","year":"1992","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Proceedings of CONCUR '92, LNCS 630, pp. 138\u2013147 (1992).","journal-title":"LNCS"},{"key":"17_CR3","first-page":"143","volume":"715","author":"S. Christensen","year":"1993","unstructured":"S. Christensen, Y. Hirshfeld and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. CONCUR '93, LNCS 715, 143\u2013157 (1993).","journal-title":"LNCS"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"S. Eilenberg and M.P. Sch\u00fctzenberger. Rational sets in commutative monoids. Journal of Algebra 13, 173\u2013191 (1969).","journal-title":"Journal of Algebra"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"J. Esparza and M. Nielsen. Decidability Issues for Petri Nets\u2014a Survey. EATCS Bulletin 52 (1994). Also: Journal of Information Processing and Cybernetics.","DOI":"10.7146\/brics.v1i8.21662"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"S. Ginsburg. The Mathematical Theory of Context-free Languages. McGraw-Hill (1966).","DOI":"10.1145\/321312.321318"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and E.H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics 16, pp. 285\u2013296 (1966).","journal-title":"Pacific Journal of Mathematics"},{"key":"17_CR8","first-page":"165","volume":"832","author":"Y. Hirshfeld","year":"1994","unstructured":"Y. Hirshfeld. Petri Nets and the Equivalence Problem. CSL '93, LNCS 832 pp. 165\u2013174 (1994).","journal-title":"LNCS"},{"key":"17_CR9","unstructured":"Y. Hirshfeld and Faron Moller. Deciding Equivalences in Simple Process Algebras. In: \u201cModal Logic and Process Algebra: Proceedings of a 3-day Workshop on Bisimulation\u201d, CSLI Press (1995)."},{"key":"17_CR10","unstructured":"Y. Hirshfeld, M. Jerrum and F. Moller. A polynomial algorithm for deciding bisimulation of normed basic parallel processes. LFCS report 94-288, Edinburgh University (1994). To appear in Journal of Mathematical Structures in Computer Science."},{"key":"17_CR11","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D.T. Huynh","year":"1983","unstructured":"D.T. Huynh. Commutative Grammars: The Complexity of Uniform Word Problems. Information and Control 57, 21\u201339 (1983).","journal-title":"Information and Control"},{"key":"17_CR13","first-page":"581","volume":"775","author":"P. Jan\u010dar","year":"1994","unstructured":"P. Jan\u010dar. Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems. STACS '94, LNCS 775, pp. 581\u2013592 (1994). To appear in Theoretical Computer Science.","journal-title":"LNCS"},{"key":"17_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall (1989)."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"P.H. Starke. Analyse von Petri-Netz Modellen. Teubner (1990).","DOI":"10.1007\/978-3-663-09262-9"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:41Z","timestamp":1605646601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}