Discrete Event Dynamic Systems

Two types of simulations and four types of bisimulations for weighted finite automata over the complete max-plus semiring we define as solutions of particular systems of matrix inequations. We provide a procedure that either decides that there is ...

The min-plus algebra is a commutative semiring with two operations: addition $\mathit{a}\oplus \mathit{b}\mathbf{:}\mathbf{=}\mathbf{min}\mathbf{(}\mathit{a}\mathbf{,}\mathit{b}\mathbf{)}$ and multiplication $\mathit{a}\otimes \mathit{b}\mathbf{:}\mathbf{=}\mathit{a}\mathbf{+}\mathit{b}$. In this paper, we discuss a min-plus algebraic counterpart of matrix diagonalization in conventional linear algebra. Due to the ...

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 ...

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-...

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 ...