A decision procedure for bisimilarity of generalized regular expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6527 LNCS, Issue , 2011, Pages 226-241

  Bonsangue, Marcello ^a   Caltais, Georgiana ^b,c   Goriac, Eugen Ioan ^b,c   Lucanu, Dorel ^c   Rutten, Jan ^d,e,f   Silva, Alexandra ^d  

^a LEIDEN UNIVERSITY   (Netherlands)

^b REYKJAVIK UNIVERSITY   (Iceland)

^c ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

^d CWI   (Netherlands)

^e RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^f VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC SPECIFICATIONS; BISIMILARITY; COALGEBRAS; COINDUCTION; DECISION PROCEDURE; DETERMINISTIC AUTOMATA; KLEENE ALGEBRAS; KLEENE'S THEOREM; LARGE CLASS; NOVEL ALGORITHM; REGULAR EXPRESSIONS; THEOREM PROVERS;

ALGEBRA; ALGORITHMS;

FORMAL METHODS;

EID: 79953038042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19829-8_15     Document Type: Conference Paper

References (15)

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án, 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: Proceedings of the 15th IEEE International Conference on Automated Software Engineering, 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 inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105, 217-273 (1992)
6. Goriac, E.-I., Lucanu, D., Roşu, G.: Automating Coinduction with Case Analysis. Technical Report TR 10-05, "Al.I.Cuza" University of Iaşi, Faculty of Computer Science (2010), http://www.infoiasi.ro/~tr/tr. pl.cgi
7. Jacobs, B.: Introduction to coalgebra. towards mathematics of states and observations (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) (Pubitemid 21691982)
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) (Pubitemid 33241737)
11. Lucanu, D., Goriac, E.-I., Caltais, G., Roşu, 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. Roşu, 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 coalgebras. Logical Methods in Computer Science 6(3) (2010)