<?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%">Filippo Bonchi</style></author><author><style face="normal" font="default" size="100%">Stefan Milius</style></author><author><style face="normal" font="default" size="100%">Fabio Zanasi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure</style></title><secondary-title><style face="normal" font="default" size="100%">CMCS -55th Annual Mathematics Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">October</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/1402.4062v2.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%">California Mathematics Council - South</style></pub-location><volume><style face="normal" font="default" size="100%">8446</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We propose an abstract framework for modeling state-based systems with internal behavior as e.g. given by silent or \epsilon-transitions. Our approach employs monads with a parametrized fixpoint operator \dagger to give a semantics to those systems and implement a sound procedure of abstraction of the internal transitions, whose labels are seen as the unit of a free monoid. More broadly, our approach extends the standard coalgebraic framework for state-based systems by taking into account the algebraic structure of the labels of their transitions. This allows to consider a wide range of other examples, including Mazurkiewicz traces for concurrent systems.&lt;/p&gt;
</style></abstract></record></records></xml>