Abstract We present a simple and e↵ective approximated backward reachability procedure for parameterized systems with existentially and universally quantified global conditions. The individual processes operate on unbounded local variables ranging over the natural numbers. In addition, processes may communicate via broadcast, rendezvous and shared variables. The procedure operates on an over-ap...

Prediction intervals in State Space models can be obtained by assuming Gaussian innovations and using the prediction equations of the Kalman filter, where the true parameters are substituted by consistent estimates. This approach has two limitations. First, it does not incorporate the uncertainty due to parameter estimation. Second, the Gaussianity assumption of future innovations may be inaccu...

In general, the result of the elimination of weakly dominated strategies depends on order. We define nice weak dominance. Under nice weak dominance, order does not matter. We identify an important class of games under which nice weak dominance and weak dominance are equivalent, and so the order under weak dominance does not matter. For all games, the result of iterative nice weak dominance is a...

We present two “fast” approaches to the NP-hard problem of computing a maximally sparse approximate solution to linear inverse problems, also known as best subset selection. The first approach, a heuristic, is an iterative algorithm globally convergent to sparse elements of any given convex, compact S C Wmr. We demonstrate its effectiveness in bandlimited extrapolation and in sparse filter desi...

We propose two models inspired by the COVID-19 pandemic: a coupled disease-human behaviour (or disease-game theoretic), and behaviour-economic model, both of which account for impact social-distancing on disease control economic growth. The exhibit rich dynamical including multistable equilibria, backward bifurcation, sustained bounded periodic oscillations. Analyses first model suggests that c...

We present the first tableau-based decision procedure for basic hybrid logic with the difference modality. The decision procedure is gracefully degrading in that the less expressive constructs don’t pay for the computationally expensive difference modality. The procedure can be specialized to reflexive and transitive frames. Key features of our approach are nominal elimination, pattern-based bl...

We use a declarative SMT-based approach to model-checking of infinite state systems to design a procedure for automatically establishing the termination of backward reachability by using well-quasiorderings. Besides showing that our procedure succeeds in many instances of problems covered by general termination results, we argue that it could predict termination also on single problems outside ...

We present a version of Herbelin’s λμ-calculus in the call-byname setting to study the precise correspondence between normalization and cut-elimination in classical logic. Our translation of λμ-terms into a set of terms in the calculus does not involve any administrative redexes, in particular η-expansion on μ-abstraction. The isomorphism preserves β, μ-reduction, which is simulated by a local-...

Fourier-Motzkin elimination (FME) procedure is often used in information theoretic context in order to simplify rate regions, e.g., by eliminating auxiliary rates. The procedure results in a system of constraints, some of which may be inactive. By incorporating the notion of Shannon-type inequalities (a class of information inequalities that are provable via a computer program), an algorithm th...

We describe the R package CovSel, which reduces the dimension of the covariate vector for the purpose of estimating an average causal effect under the unconfoundedness assumption. Covariate selection algorithms developed in De Luna, Waernbaum, and Richardson (2011) are implemented using model-free backward elimination. We show how to use the package to select minimal sets of covariates. The pac...