<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marcello Bonsangue</style></author><author><style face="normal" font="default" size="100%">Georgiana Caltais</style></author><author><style face="normal" font="default" size="100%">Eugen Goriac</style></author><author><style face="normal" font="default" size="100%">Dorel Lucanu</style></author><author><style face="normal" font="default" size="100%">Jan Rutten</style></author><author><style face="normal" font="default" size="100%">Alexandra Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Automatic equivalence proofs for non-deterministic coalgebras (revised and extended)</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/xana/files/18793d.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">SEN 11-13</style></number><publisher><style face="normal" font="default" size="100%">Centrum Wiskunde &amp; Informatica (CWI)</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><pages><style face="normal" font="default" size="100%">1-38</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene’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, Mealy machines and labelled transition sytems. In this paper, we present 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. We illustrate the generality of the tool with three examples: infinite streams of real numbers, Mealy machines and labelled transition systems.&lt;/p&gt;
</style></abstract></record></records></xml>