A Decision Procedure for Bisimilarity of Generalized Regular Expressions - Formal Methods: Foundations and Applications - page 241

Acknowledgments. The authors are grateful for useful comments from Filippo
Bonchi and the anonymous reviewers. The work of Georgiana Caltais and Eugen-
Ioan Goriac has been partially supported by the PNII grant CNCSIS IDEI 393
and the project 'Meta-theory of Algebraic Process Theories' (nr. 100014021)
of the Icelandic Research Fund. The work of Dorel Lucanu has been partially
supported by the PNII grant CNCSIS IDEI 393.
References
1. Bonsangue, M.M., Rutten, J.J.M.M., Silva, A.: An algebra for Kripke polynomial
coalgebras. In: LICS, pp. 49-58. IEEE Computer Society, Los Alamitos (2009)
2. Bonsangue, M., Rutten, J., Silva, A.: A Kleene theorem for polynomial coalgebras.
In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 122-136. Springer,
Heidelberg (2009)
3. Clavel, M., Dur´an,F,Eker,S,Lincoln,P,Martı-Oliet, N., Meseguer, J.,
Talcott, C.L. (eds.): All About Maude - A High-Performance Logical Framework.
LNCS, vol. 4350. Springer, Heidelberg (2007)
4. Goguen, J., Lin, K., Rosu, G.: Circular coinductive rewriting. In: ASE 2000: Pro-
ceedings of the 15th IEEE International Conference on Automated Software Engi-
neering, Washington, DC, USA, 2000, pp. 123-132. IEEE Computer Society, Los
Alamitos (2000)
5. Goguen, J.A.: Order-sorted algebra i: Equational deduction for multiple inheri-
tance, overloading, exceptions and partial operations. Theoretical Computer Sci-
ence 105, 217-273 (1992)
6. Goriac, E.-I., Lucanu, D., Rosu, G.: Automating Coinduction with Case Analysis.
Technical Report TR 10-05, “Al.I.Cuza” University of Iasi, Faculty of Computer
Science (2010), http://www.infoiasi.ro/ ~ tr/tr.pl.cgi
7. Jacobs, B.: Introduction to coalgebra. towards mathematics of states and observa-
tions (2005)
8. Kleene, S.: Representation of events in nerve nets and finite automata. Automata
Studies, 3-42 (1956)
9. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular
events. In: LICS, pp. 214-225. IEEE Computer Society, Los Alamitos (1991)
10. Kozen, D.: Myhill-nerode relations on automatic systems and the completeness of
Kleene algebra. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010,
pp. 27-38. Springer, Heidelberg (2001)
11. Lucanu, D., Goriac, E.-I., Caltais, G., Rosu, G.: CIRC: A behavioral verification
tool based on circular coinduction. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.)
CALCO 2009. LNCS, vol. 5728, pp. 433-442. Springer, Heidelberg (2009)
12. Rosu, G., Lucanu, D.: Circular Coinduction - A Proof Theoretical Foundation.
In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp.
127-144. Springer, Heidelberg (2009)
13. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput.
Sci. 249(1), 3-80 (2000)
14. Salomaa, A.: Two complete axiom systems for the algebra of regular events. J.
ACM 13(1), 158-169 (1966)
15. Silva, A., Bonsangue, M.M., Rutten, J.J.M.M.: Non-deterministic kleene coalge-
bras. Logical Methods in Computer Science 6(3) (2010)