The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Flexible and distributed management systems based on mobile agents have certain advantages over centralized and static management architectures. However, security plays a decisive...
— We present a tool, PerfCenter, that takes as input the deployment, configuration, message flow and workload details of the hardware and software servers in an application hos...
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...