Modular cut-elimination is a particular notion of ”cut-elimination in the presence of non-logical axioms” that is preserved under the addition of suitable rules. We introduce syntactic necessary and sufficient conditions for modular cut-elimination for standard calculi, a wide class of (possibly) multipleconclusion sequent calculi with generalized quantifiers. We provide a ”universal” modular c...

In this paper we consider the notions of global-fairness (G-fairness) and bounded-fairness (B-fairness) for arbitrary Petri nets (PNs). G-fairness in a PN guarantees every transition occurs infinitely often in every valid firing sequence of infinite length. B-fairness guarantees a bound on the number of times a transition in the PN can fire without some transition firing at least once. These pr...

We study continuous (strongly) minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory-Johnson setting, as well as a recent extension by Cornuéjols and Yıldız. We show that for any continuous minimal or strongly minimal cut generating function, there exists an extreme cut generating function that approximates the (strongly) minimal fu...

Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. It merges a lot of physical resources and offers them to users as services according to service level agreement. Therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. Presenting a proper scheduling ...