activity
20102024
most citedGeneralizing determinization from automata to coalgebras

111 citations · 210 across the 11 of their papers we have counts for

collaborators

11 papers

cs.CY2024★ 2 cited

How to Evaluate Games in Education: A Literature Review

Giulio Barbero, Marcello M. Bonsangue, Felienne F. J. Hermans

Adding game elements to higher education is an increasingly common practice. As a result, many recent empirical studies focus on studying the effectiveness of gamified or game-base…

cs.FL2020

Minimisation in Logical Form

Nick Bezhanishvili, Marcello Bonsangue, Helle Hvid Hansen +4

Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation…

cs.LO2019★ 4 cited

Completeness and Incompleteness of Synchronous Kleene Algebra

Jana Wagemaker, Marcello Bonsangue, Tobias Kappé +2

Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lo…

cs.LO2015★ 15 cited

Presenting Distributive Laws

Marcello M. Bonsangue, Helle Hvid Hansen, Alexander Kurz +1

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive e…

cs.LO2013★ 20 cited

Coalgebraic Characterizations of Context-Free Languages

Joost Winter, Jan J. M. Rutten, Marcello M. Bonsangue

In this article, we provide three coalgebraic characterizations of the class of context-free languages, each based on the idea of adding coalgebraic structure to an existing algebr…

cs.LO2013

Automatic Equivalence Proofs for Non-deterministic Coalgebras

Marcello Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac +3

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…

cs.LO2013★ 111 cited

Generalizing determinization from automata to coalgebras

Alexandra Silva, Filippo Bonchi, Marcello Bonsangue +1

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powers…

cs.PL2012★ 6 cited

Interacting via the Heap in the Presence of Recursion

Jurriaan Rot, Irina Măriuca Asăvoae, Frank de Boer +2

Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating ref…

cs.LO2012★ 3 cited

On the specification of operations on the rational behaviour of systems

Marcello M. Bonsangue, Stefan Milius, Jurriaan Rot

Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic ope…

cs.LO2011★ 38 cited

Sound and complete axiomatizations of coalgebraic language equivalence

Marcello M. Bonsangue, Stefan Milius, Alexandra Silva

Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate…

cs.LO2010★ 11 cited

Non-Deterministic Kleene Coalgebras

Alexandra Silva, Marcello Bonsangue, Jan Rutten

In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of…