We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
Lars Birkedal, Troels Christoffer Damgaard, Arne J...
We introduce a new programming language called BlenX. It is strongly inspired to process calculi and it is an evolution of Betabinders. It has been specifically designed and implem...
We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different language...
We derive in this paper a unified framework for a priori and a posteriori error analysis of mixed finite element discretizations of second-order elliptic problems. It is based on ...
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...