Related papers: Timed Automata with Polynomial Delay and their Exp…

Systems of differential equations with state-dependent delay are considered. The delay dynamically depends on the state i.e. is governed by an additional differential equation. By applying the time transformations we arrive to constant…

We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not…

The paper concerns a class of $n$-dimensional non-autonomous delay differential equations obtained by adding a non-monotone delayed perturbation to a linear homogeneous cooperative system of ordinary differential equations. This family…

The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is well known that both problems are undecidable.…

Time-varying linear state-space models are powerful tools for obtaining mathematically interpretable representations of neural signals. For example, switching and decomposed models describe complex systems using latent variables that evolve…

This paper develops the first class of algorithms that enable unbiased estimation of steady-state expectations for multidimensional reflected Brownian motion. In order to explain our ideas, we first consider the case of compound Poisson…

In this work we give a criterion to have an exponential dichotomy over all $\mathbb{R}$ for delayed systems $x'(t)=L(t)x_t$, where $L_{\pm}=\lim_{t\to\pm\infty}L(t)$, and the systems $x'(t)=L_{\pm}x_t$ are autonomous and hyperbolic. The…

This paper deals with the time-varying high dimensional covariance matrix estimation. We propose two covariance matrix estimators corresponding with a time-varying approximate factor model and a time-varying approximate characteristic-based…

By developing new efficient techniques and using an appropriate fixed point theorem, we derive several new sufficient conditions for the pseudo almost periodic solutions with double measure for some system of differential equations with…

The solvability of a delay differential equation arising in the construction of quadratic cost functionals, i.e. Lyapunov functionals, for a linear time-delay system with a constant and a distributed delay is investigated. We present a…

We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with…

This article investigates the stability of pantograph delay differential equations, in which the delayed argument is proportional to the present time. We derive analytic criteria that partition the parameter plane into unstable,…

Ensuring the correctness of critical real-time systems, involving concurrent behaviours and timing requirements, is crucial. Timed automata extend finite-state automata with clocks, compared in guards and invariants with integer constants.…

We introduce a new formalism of higher-dimensional timed automata, based on van Glabbeek's higher-dimensional automata and Alur's timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based…

This paper studies scheduling coupled tasks with exact delays to minimize maximum lateness. The first task has processing time $p>0$ and the second $b_i\geq 0$, also the second needs to start exactly $p$ units of time after the completion…

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic…

The presence of a delay between sensing and reacting to a signal can determine the long-term behavior of autonomous agents whose motion is intrinsically noisy. In a previous work [M. Mijalkov, A. McDaniel, J. Wehr, and G. Volpe, Phys. Rev.…

Expressive human speech generally abounds with rich and flexible speech prosody variations. The speech prosody predictors in existing expressive speech synthesis methods mostly produce deterministic predictions, which are learned by…

We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be…

In this work we extend the Emerson and Kahlon's cutoff theorems for process skeletons with conjunctive guards to Parameterized Networks of Timed Automata, i.e. systems obtained by an \emph{apriori} unknown number of Timed Automata…