@conference {BG10,
	title = {A decision procedure for bisimilarity of generalized regular expressions},
	booktitle = {Proceedings of the 13th Brazilian Symposium on Formal Methods (SBMF 2010)},
	series = {Lecture Notes in Computer Science},
	volume = {6527},
	year = {2010},
	month = {November },
	pages = {226{\textendash}241},
	publisher = {Springer},
	organization = {Springer},
	address = {Natal, Brazil},
	abstract = {<p>A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene{\textquoteright}s theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems covered include infinite streams, deterministic automata and Mealy machines. In this paper, we present a tool where the aforementioned expressions can be derived automatically and a novel algorithm to decide whether two expressions are bisimilar or not. The procedure is implemented in the automatic theorem prover CIRC, by reducing coinduction to an entailment relation between an algebraic specification and an appropriate set of equations.</p>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/xana/files/sbmf10.pdf},
	author = {Marcello Bonsangue and Georgiana Caltais and Eugen Goriac and Dorel Lucanu and Jan Rutten and Alexandra Silva}
}