Related papers: State estimation of timed automata under partial o…
In networked control systems, the advent of event-triggering strategies in the sampling process has resulted in the usage reduction of network capacities, such as communication bandwidth. However, the aperiodic nature of sampling periods…
This paper addresses the synthesis of interval observers for partially unknown nonlinear systems subject to bounded noise, aiming to simultaneously estimate system states and learn a model of the unknown dynamics. Our approach leverages…
We analyze the estimation of a time dependent perturbation acting on a continuously monitored quantum system. We describe the temporal fluctuations of the perturbation by a Hidden Markov Model, and we combine quantum measurement theory and…
Timed Concurrent State Machines are an application of Alur's Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea of testing automata, allowing to specify time properties…
We consider distributed systems with an arbitrary number of processes, modelled by timed automata that communicate through location guards: a process can take a guarded transition if at least one other process is in a given location. In…
This paper considers the problem of designing interval observers for hidden mode switched nonlinear systems with bounded noise signals that are compromised by false data injection and switching attacks. The proposed observer consists of…
This article generalizes the conditional probability interpretation of time in which time evolution is realized through entanglement between a clock and a system of interest. This formalism is based upon conditioning a solution to the…
A hybrid dynamical system switches between dynamic regimes at time- or state-triggered events. We propose an offline algorithm that simultaneously estimates discrete and continuous components of a hybrid system's state. We formulate state…
We investigate a single machine rescheduling problem that arises from an unexpected machine unavailability, after the given set of jobs has already been scheduled to minimize the total weighted completion time. Such a disruption is…
In this work we present an epistemic analysis of time phenomenon using the mathematical machinery of information theory and modular theory. By adopting limited commitment to the ontology of time evolution, and instead by mainly relying on…
Periodic recurrence is a prominent behavioural of many biological phenomena, including cell cycle and circadian rhythms. Although deterministic models are commonly used to represent the dynamics of periodic phenomena, it is known that they…
Timed B\"uchi automata provide a very expressive formalism for expressing requirements of real-time systems. Online monitoring and active testing of embedded real-time systems can then be achieved by symbolic execution of such automata on…
The time-dependent vulnerability of synchronized states is shown for a complex network composed of electronic circuits. We demonstrate that disturbances to the local dynamics of network units can produce different outcomes to…
In conditional automation, the automated driving system assumes full control and only issues a takeover request to a human driver to resume driving in critical situations. Previous studies have concluded that the time budget required by…
We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are defined. The problem of model checking for deadlock…
Alternating timed automata (ATA) are an extension of timed automata, that are closed under complementation and hence amenable to logic-to-automata translations. Several timed logics, including Metric Temporal Logic (MTL), can be converted…
Timed automata (TA) are a well-established formalism for specifying discrete-state/continuous-time behavior of time-critical reactive systems. Concerning the fundamental analysis problem of comparing a candidate implementation against a…
We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability…
We propose a time-of-arrival operator in quantum mechanics by conditioning on a quantum clock. This allows us to bypass some of the problems of previous proposals, and to obtain a Hermitian time of arrival operator whose probability…
In this paper we address the problem of state observation of linear time-varying systems with delayed measurements, which has attracted the attention of many researchers|see [7] and references therein. We show that, adopting the parameter…