The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
A model is presented for the analysis of bioremediation applied to an ex situ soil pile. The approach is based on the remediation of a pile containing the contaminated soil, which...
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...