Is it Worth Migrating a Monolith to Microservices? An Experience Report on Performance, Availability and Energy Usage

Generalized Distance Polymatrix Games (short paper)

We propose a new class of generalized distance polymatrix games, which extends distance polymatrix coordination games by allowing each subgame to be played by more than two agents. These games can be effectively modeled using hypergraphs, where each hyperedge represents a subgame played by its agents. Similar to distance polymatrix coordination games, the overall utility of a player 𝑥 depends on the payoffs of subgames involving players within a certain distance from 𝑥. As in the original m...

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes

As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second, on Milner's process interpretation of regular expressions, a proper subclass of the finite-state processes. The aim of my talk was to motivate a transferal of ideas for workable concepts of structure-constrained graphs: from the problem of finding compact g...

A coinductive version of Milner's proof system for regular expressions modulo bisimilarity

By adapting Salomaa’s complete proof system for equality of regular expressions under the language semantics, Milner (1984) formulated a sound proof system for bisimilarity of regular expressions under the process interpretation he introduced. He asked whether this system is complete. Proof-theoretic arguments attempting to show completeness of this equational system are complicated by the presence of a non-algebraic rule for solving fixed-point equations by using star iteration. We characte...