How to Kill Epsilons with a Dagger: A Coalgebraic Take on Systems with Algebraic Label Structure
Author(s): Bonchi F, Milius S, Silva A, Zanasi F
Title edited volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publishing place: Berlin/Heidelberg
Publication year: 2014
Conference Proceedings Title: Proc. Coalgebraic Methods in Computer Science (CMCS'14)
Pages range: 53-74
Event: The 12th International Workshop on Coalgebraic Methods in Computer Science
Event location: Grenoble, France
Start date of the event: 05/04/2014
End date of the event: 06/04/2014
We propose an abstract framework for modeling state-based systems with internal behavior as e.g. given by silent or -transitions. Our approach employs monads with a parametrized fixpoint operator 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. © 2014 IFIP International Federation for Information Processing.
FAU Authors / FAU Editors How to cite
APA: Bonchi, F., Milius, S., Silva, A., & Zanasi, F. (2014). How to Kill Epsilons with a Dagger: A Coalgebraic Take on Systems with Algebraic Label Structure. In Proc. Coalgebraic Methods in Computer Science (CMCS'14) (pp. 53-74). Berlin/Heidelberg: Springer.
MLA: Bonchi, Filippo, et al. "How to Kill Epsilons with a Dagger: A Coalgebraic Take on Systems with Algebraic Label Structure." Proceedings of the The 12th International Workshop on Coalgebraic Methods in Computer Science, Grenoble, France Berlin/Heidelberg: Springer, 2014. 53-74.