Related papers: Coarse abstractions make Zeno behaviours difficult…
This paper proposes a thought experiment to search for efficient bounded algorithms of NPC problems by machine enumeration. The key contributions are: -- On Universal Turing Machines, a program's time complexity should be characterized as:…
We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose…
Intuitively, an (implementation) automata is simulated by a (specification) automata if every externally observable transition by the implementation automata can also be made by the specification automata. In this work, we present a…
Critical observability is a property of cyber-physical systems to detect whether the current state belongs to a set of critical states. In safety-critical applications, critical states model operations that may be unsafe or of a particular…
The right to AI explainability has consolidated as a consensus in the research community and policy-making. However, a key component of explainability has been missing: extrapolation, which describes the extent to which AI models can be…
Monitoring is an important part of the verification toolbox, in particular in situations where exhaustive verification using, e.g., model-checking is infeasible. The goal of online monitoring is to determine the satisfaction or violation of…
We show that the problem of checking if a given nondeterministic parity automaton simulates another given nondeterministic parity automaton is NP-hard. We then adapt the techniques used for this result to show that the problem of checking…
According to the quantum Zeno effect, the frequent observations of a system can dramatically slow down its dynamical evolution. We show that the Zeno dynamics is the result of projective measurements among quantum states which are…
We prove the quantum Zeno effect in open quantum systems whose evolution, governed by quantum dynamical semigroups, is repeatedly and frequently interrupted by the action of a quantum operation. For the case of a quantum dynamical semigroup…
Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can…
We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we…
The Zeno time has been calculated for a metastable two level atom tunneling through a interacting thermal magnetic field. The process of weak measurement has been utilized for the the estimation of the timescale. The temperature dependence…
The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse…
In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results…
In this paper, we take a closer look at the claims made by Xu and Zhou in their paper "SAT Requires Exhaustive Search" [XZ23], which claims to provide a lower bound on the complexity of the so-called Model RB. Xu and Zhou conclude that…
The present essay aims at investigating whether and how far an algebraic analysis of the Zeta Function and of the Riemann Hypothesis can be carried out. Of course the well-established properties of the Zeta Function, explored in depth in…
This paper presents a novel algorithm for reachability analysis of nonlinear discrete-time systems. The proposed method combines constrained zonotopes (CZs) with polyhedral relaxations of factorable representations of nonlinear functions to…
This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless…
The finite Dirichlet series from the title are defined by the condition that they vanish at as many initial zeroes of the zeta function as possible. It turned out that such series can produce extremely good approximations to the values of…
A key challenge in abstraction-based verification and control under complex specifications such as Linear Temporal Logic (LTL) is that abstract models retain significantly less information than their original systems. This issue is…