%0 Conference Proceedings
%T How to Kill Epsilons with a Dagger
%+ Laboratoire de l'Informatique du Parallélisme (LIP)
%+ Friedrich-Alexander Universität Erlangen-Nürnberg = University of Erlangen-Nuremberg (FAU)
%+ Radboud University [Nijmegen]
%+ Centrum Wiskunde & Informatica (CWI)
%+ Universidade do Minho = University of Minho  [Braga]
%A Bonchi, Filippo
%A Milius, Stefan
%A Silva, Alexandra
%A Zanasi, Fabio
%Z Part 2: Regular Contributions
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS)
%C Grenoble, France
%Y Marcello M. Bonsangue
%3 Coalgebraic Methods in Computer Science
%V 8446
%P 53-74
%8 2014-04-05
%D 2014
%R 10.1007/978-3-662-44124-4_4
%Z Computer Science [cs]Conference papers
%X We propose an abstract framework for modeling state-based systems with internal behavior as e.g. given by silent or <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>&#x03F5;<!-- ϵ --></mi> </math>-transitions. Our approach employs monads with a parametrized fixpoint operator <math xmlns="http://www.w3.org/1998/Math/MathML"> <mo>&#x2020;<!-- † --></mo> </math> 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-01408752/document
%2 https://inria.hal.science/hal-01408752/file/328263_1_En_4_Chapter.pdf
%L hal-01408752
%U https://inria.hal.science/hal-01408752
%~ ENS-LYON
%~ CNRS
%~ INRIA
%~ UNIV-LYON1
%~ LIP_PLUME
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-8446
%~ IFIP-WG1-3
%~ IFIP-CMCS
%~ INRIA-AUT
%~ UDL
%~ UNIV-LYON