{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:00:02Z","timestamp":1768683602110,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198281","type":"print"},{"value":"9783642198298","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19829-8_15","type":"book-chapter","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T14:20:41Z","timestamp":1300285241000},"page":"226-241","source":"Crossref","is-referenced-by-count":5,"title":["A Decision Procedure for Bisimilarity of Generalized Regular Expressions"],"prefix":"10.1007","author":[{"given":"Marcello","family":"Bonsangue","sequence":"first","affiliation":[]},{"given":"Georgiana","family":"Caltais","sequence":"additional","affiliation":[]},{"given":"Eugen-Ioan","family":"Goriac","sequence":"additional","affiliation":[]},{"given":"Dorel","family":"Lucanu","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","first-page":"49","volume-title":"LICS","author":"M.M. Bonsangue","year":"2009","unstructured":"Bonsangue, M.M., Rutten, J.J.M.M., Silva, A.: An algebra for Kripke polynomial coalgebras. In: LICS, pp. 49\u201358. IEEE Computer Society, Los Alamitos (2009)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-00596-1_10","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Bonsangue","year":"2009","unstructured":"Bonsangue, M., Rutten, J., Silva, A.: A Kleene theorem for polynomial coalgebras. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 122\u2013136. Springer, Heidelberg (2009)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/ASE.2000.873657","volume-title":"ASE 2000: Proceedings of the 15th IEEE International Conference on Automated Software Engineering","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Lin, K., Rosu, G.: Circular coinductive rewriting. In: ASE 2000: Proceedings of the 15th IEEE International Conference on Automated Software Engineering, Washington, DC, USA, 2000, pp. 123\u2013132. IEEE Computer Society, Los Alamitos (2000)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J.A. Goguen","year":"1992","unstructured":"Goguen, J.A.: Order-sorted algebra i: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science\u00a0105, 217\u2013273 (1992)","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Goriac, E.-I., Lucanu, D., Ro\u015fu, G.: Automating Coinduction with Case Analysis. Technical Report TR 10-05, \u201cAl.I.Cuza\u201d University of Ia\u015fi, Faculty of Computer Science (2010), \n                  \n                    http:\/\/www.infoiasi.ro\/~tr\/tr.pl.cgi","DOI":"10.1007\/978-3-642-16901-4_16"},{"key":"15_CR7","unstructured":"Jacobs, B.: Introduction to coalgebra. towards mathematics of states and observations (2005)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, 3\u201342 (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"15_CR9","first-page":"214","volume-title":"LICS","author":"D. Kozen","year":"1991","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: LICS, pp. 214\u2013225. IEEE Computer Society, Los Alamitos (1991)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44693-1_3","volume-title":"STACS 2001","author":"D. Kozen","year":"2001","unstructured":"Kozen, D.: Myhill-nerode relations on automatic systems and the completeness of Kleene algebra. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 27\u201338. Springer, Heidelberg (2001)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-03741-2_30","volume-title":"Algebra and Coalgebra in Computer Science","author":"D. Lucanu","year":"2009","unstructured":"Lucanu, D., Goriac, E.-I., Caltais, G., Ro\u015fu, G.: CIRC: A behavioral verification tool based on circular coinduction. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 433\u2013442. Springer, Heidelberg (2009)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-03741-2_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G. Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Lucanu, D.: Circular Coinduction \u2013 A Proof Theoretical Foundation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 127\u2013144. Springer, Heidelberg (2009)"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM\u00a013(1), 158\u2013169 (1966)","journal-title":"J. ACM"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonsangue, M.M., Rutten, J.J.M.M.: Non-deterministic kleene coalgebras. Logical Methods in Computer Science\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:23)2010"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19829-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:22:49Z","timestamp":1558437769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19829-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198281","9783642198298"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19829-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}