Switched max-plus linear-dual inequalities: cycle time analysis and applications

no code implementations • 4 May 2023 • Davide Zorzenon, Jan Komenda, Jörg Raisch

P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows.

Weak consistency of P-time event graphs

no code implementations • 1 Jun 2022 • Davide Zorzenon, Jiří Balun, Jörg Raisch

P-time event graphs (P-TEGs) are event graphs where the residence time of tokens in places is bounded by specified time windows.

Switched Max-Plus Linear-Dual Inequalities: Application in Scheduling of Multi-Product Processing Networks

no code implementations • 3 Apr 2022 • Davide Zorzenon, Jan Komenda, Jörg Raisch

P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows.

Scheduling

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory

no code implementations • 24 Feb 2021 • Davide Zorzenon, Jan Komenda, Joerg Raisch

This problem, which generalizes other instances of the NCP previously investigated in the literature, has applications in the consistency analysis of a class of discrete-event systems called P-time event graphs.

Combinatorics Systems and Control Systems and Control Optimization and Control 68R10 (Primary) 15A80, 68Q45 (Secondary)

Low Complexity Method for Simulation of Epidemics Based on Dijkstra's Algorithm

no code implementations • 6 Oct 2020 • Davide Zorzenon, Fabio Molinari, Joerg Raisch

Models of epidemics over networks have become popular, as they describe the impact of individual behavior on infection spread.