Related papers: Bisimulation Finiteness of Pushdown Systems Is Ele…

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance…

We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…

In this note, it is shown that several results concerning mean equicontinuity proved before for minimal systems are actually held for general topological dynamical systems. Particularly, it turns out that a dynamical system is mean…

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…

This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…

Several important conjectures in Fractal Geometry can be summarised as follows: If the dimension of a self-similar measure in $\mathbb{R}$ does not equal its expected value, then the underlying iterated function system contains an exact…

The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…

We address the question whether the super-Heisenberg scaling for quantum estimation is realizable. We unify the results of two approaches. In the first one, the original system is compared with its copy rotated by the parameter dependent…

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The…

We show that any cadlag predictable process of finite variation is an a.s. limit of elementary predictable processes; it follows that predictable stopping times can be approximated `from below' by predictable stopping times which take…

Recently, it has been argued that quantum mechanics is complete, and that quantum states vectors are necessarily in one-to-one correspondence with the elements of reality, under the assumptions that quantum theory is correct and that…

We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state…

It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between the easy to obtain PSPACE lower bound and the EXPSPACE upper…

We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…

In existing simulation proof techniques, a single step in a lower-level specification may be simulated by an extended execution fragment in a higher-level one. As a result, it is cumbersome to mechanize these techniques using general…

We construct non-compactness examples for the fully coupled Einstein-Lichnerowicz constraint system in the focusing case. The construction is obtained by combining pointwise a priori asymptotic analysis techniques, finite-dimensional…

Working notes on setting up approximate dynamical systems and nonlinear eigenvalue problems, here embedded within the theory of complex nonlinear dynamics. Computations parallel those of linear quantum theory except that we use functional…

We study systems with a continuous phase transition that tune their parameters to maximize a quantity that diverges solely at a unique critical point. Varying the size of these systems with dynamically adjusting parameters, the same…

We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…

We investigate the universality of multi-spin systems in architectures of various symmetries of coupling type and topology. Explicit reachability sets under symmetry constraints are provided. Thus for a given (possibly symmetric)…