activity
20132026
most citedBehavioural equivalences for coalgebras with unobservable moves

19 citations · 96 across the 34 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.LO2019

Towards a Formal Model for Composable Container Systems

Fabio Burco, Marino Miculan, Marco Peressotti

In modern cloud-based architectures, containers play a central role: they provide powerful isolation mechanisms such that developers can focus on the logic and dependencies of appl…

cs.LO2019

A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework

Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle +2

Graph transformation approaches have been successfully used to analyse and design chemical and biological systems. Here we build on top of a DPO framework, in which molecules are m…

cs.LO2019

Two modes of recognition: algebra, coalgebra, and languages

Tomasz Brengos, Marco Peressotti

The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of mo…

cs.PL2019★ 3 cited

No more, no less - A formal model for serverless computing

Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese +3

Serverless computing, also known as Functions-as-a-Service, is a recent paradigm aimed at simplifying the programming of cloud applications. The idea is that developers design appl…

cs.LO2019★ 2 cited

Taking Linear Logic Apart

Wen Kokke, Fabrizio Montesi, Marco Peressotti

Process calculi based on logic, such as DILL and CP, provide a foundation for deadlock-free concurrent programming. However, in previous work, there is a mismatch between the ru…