Abstract -- Shortest path routing protocols may suffer from congestion due to the use of a single shortest path between a source and a destination. The goal of our work is to first...
—We propose a new parametric class of scheduling and routing policies for open multiclass queueing networks. We establish their stability and show they are amenable to distribute...
Ioannis Ch. Paschalidis, Chang Su, Michael Caraman...
Reproducing and learning from failures in deployed software is costly and difficult. Those activities can be facilitated, however, if the circumstances leading to a failure are p...
Sebastian G. Elbaum, Satya Kanduri, Anneliese Amsc...
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
Recently we proposed a mathematical framework offering diverse models of computation and a formal foundation for correct-byconstruction deployment of synchronous designs over dist...