Related papers: Bisimilarity of Pushdown Systems is Nonelementary
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test…
We consider mixed finite element methods for linear elasticity where the symmetry of the stress tensor is weakly enforced. Both an a priori and a posteriori error analysis are given for several known families of methods that are uniformly…
We consider the uniform parallel machines scheduling problem in the context of optimistic bilevel optimization, where two speed options are considered. In this scenario, the leader aims to minimize the weighted number of tardy jobs, while…
We establish an exponential stabilization result for linear port-Hamiltonian systems of first order with quite general, not necessarily continuous, energy densities. In fact, we have only to require the energy density of the system to be of…
Existence and non-existence results are established for quasilinear elliptic problems with nonlinear boundary conditions and lack of compactness. The proofs combine variational methods with the geometrical feature, due to the competition…
We devise variants of classical nonconforming methods for symmetric elliptic problems. These variants differ from the original ones only by transforming discrete test functions into conforming functions before applying the load functional.…
We present a variational characterization of mechanical equilibrium in the planar strain regime for systems with incompatible kinematics. For non-simply connected domains, we show that the equilibrium problem for a non-liftable…
We consider two-stage robust optimization problems, which can be seen as games between a decision maker and an adversary. After the decision maker fixes part of the solution, the adversary chooses a scenario from a specified uncertainty…
Unconstrained submodular maximization captures many NP-hard combinatorial optimization problems, including Max-Cut, Max-Di-Cut, and variants of facility location problems. Recently, Buchbinder et al. presented a surprisingly simple linear…
We establish well-posedness results for non-autonomous semilinear input-output systems, the central assumption being the scattering-passivity of the considered semilinear system. We consider both systems with distributed control and…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
Register automata are a basic model of computation over infinite alphabets. Fresh-register automata extend register automata with the capability to generate fresh symbols in order to model computational scenarios involving name creation.…
The goal of this paper is to establish that it remains undecidable whether a sequent is provable in two systems in which a weakening rule for an exponential modality is completely omitted from classical propositional linear logic…
A classical counterexample due to E. De Giorgi, shows that the weak maximum principle does not remain true for general linear elliptic differential systems. After that, there are some efforts to establish the weak maximum principle for…
The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak omega-DPDAs. Furthermore, we…
Mixed variational formulations for the first-order system of the elastic membrane obstacle problem and the second-order system of the Kirchhoff--Love plate obstacle problem are proposed. The force exerted by the rigid obstacle is included…
We consider the bilevel minimum spanning tree (BMST) problem where the leader and the follower choose a spanning tree together, according to different objective functions. By showing that this problem is NP-hard in general, we answer an…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…
Solutions of bilevel optimization problems tend to suffer from instability under changes to problem data. In the optimistic setting, we construct a lifted formulation that exhibits desirable stability properties under mild assumptions that…