<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandra Silva</style></author><author><style face="normal" font="default" size="100%">Damien Pous</style></author><author><style face="normal" font="default" size="100%">Georgiana Caltais</style></author><author><style face="normal" font="default" size="100%">Filippo Bonchi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Brzozowski's and up to algorithms for must testing</style></title><secondary-title><style face="normal" font="default" size="100%">APLAS - 11th Asian Symposium on Programming Languages and Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">December</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/xana/files/aplas13bcps.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Melbourne, Australia</style></pub-location><volume><style face="normal" font="default" size="100%">8301</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Checking language equivalence (or inclusion) of nite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more eective solutions, such as approaches based on antichains or bisimulations up-to. Several notions of equivalence (or preorder) have been proposed for the analysis of concurrent systems. Usually, the problem of checking these equivalences is reduced to checking bisimilarity. In this paper, we take a diferent approach and propose to adapt algorithms for language equivalence to check one prime equivalence in concurrency theory, must testing semantics. To achieve this transfer of technology from language to must semantics, we take a coalgebraic outlook at the problem.&lt;/p&gt;
</style></abstract></record></records></xml>