A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...
Lorenzo Bettini, Sara Capecchi, Mariangiola Dezani...
Abstract. In this paper we tackle the problem of designing and implementing a framework for programming service coordination policies. In particular, we illustrate the design and t...
Gian Luigi Ferrari, Roberto Guanciale, Daniele Str...
We show that the category FinVectk of finite dimensional vector spaces and linear maps over any field k is (collectively) complete for the traced symmetric monoidal category freely...
Masahito Hasegawa, Martin Hofmann, Gordon D. Plotk...
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...