An algebraic control method to guarantee generalized marking constraints for partially observable timed event graphs
This work deals with the control problem of Discrete Event Systems (DESs) modelled by Timed Event Graphs (TEGs) and subject to Generalized Marking Constraints (GMCs). The aim of this paper is to propose an algebraic methodology for the ...
Offline analysis of the relaxed upper boundedness for online estimation ofoptimal event sequences in Partially Observable Petri Nets
The aim of this paper is the analysis of the property of the relaxed structurally boundedness of the unobservable subnet of the Petri net which brings a condition guaranteeing the finitude of all possible sequence lengths in the context of an on-...
MGF-based SNC for stationary independent Markovian processes with localized application of martingales
Stochastic Network Calculus is a probabilistic method to compute performance bounds in networks, such as end-to-end delays. It relies on the analysis of stochastic processes using formalism of (Deterministic) Network Calculus. However, unlike the ...