Search

• < Previous
• 1
• Next >

---

Symbolic and Asynchronous Semantics via Normalized Coalgebras

Filippo Bonchi ; Ugo Montanari.

The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since the behaviour of interactive systems is for many reasons&nbsp;[&hellip;]

---

Generalizing determinization from automata to coalgebras

Alexandra Silva ; Filippo Bonchi ; Marcello Bonsangue ; Jan Rutten.

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 powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an&nbsp;[&hellip;]

---

Bialgebraic Semantics for Logic Programming

Filippo Bonchi ; Fabio Zanasi.

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques&nbsp;[&hellip;]

---

Coalgebraic Behavioral Metrics

Paolo Baldan ; Filippo Bonchi ; Henning Kerstan ; Barbara König.

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure&nbsp;[&hellip;]

---

Distribution Bisimilarity via the Power of Convex Algebras

Filippo Bonchi ; Alexandra Silva ; Ana Sokolova.

Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more recently) distribution bisimilarity. The latter is based on&nbsp;[&hellip;]

---

The Theory of Traces for Systems with Nondeterminism, Probability, and Termination

Filippo Bonchi ; Ana Sokolova ; Valeria Vignudelli.

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction. We characterise and compare the&nbsp;[&hellip;]

---

Convexity via Weak Distributive Laws

Filippo Bonchi ; Alessio Santamaria.

We study the canonical weak distributive law $\delta$ of the powerset monad over the semimodule monad for a certain class of semirings containing, in particular, positive semifields. For this subclass we characterise $\delta$ as a convex closure in the free semimodule of a set. Using the abstract&nbsp;[&hellip;]

---