5 citations · 25 across the 12 of their papers we have counts for
12 papers
A Luenberger Observer for P-Time Event Graphs
Dominik Tirpák, Davide Zorzenon, Jörg Raisch
P-Time Event Graphs (P-TEGs) are discrete event systems able to model synchronization and delay phenomena. They extend the modeling power of Timed Event Graphs (TEGs) by including…
Infinite precedence graphs for consistency verification in P-time event graphs
Davide Zorzenon, Jörg Raisch
Precedence constraints are inequalities used to model time dependencies. In 1958, Gallai proved that a finite system of precedence constraints admits solutions if and only if the c…
Controlled Invariance in Fully Actuated Max-plus Linear Systems with Precedence Semimodules
Davide Zorzenon, Jörg Raisch
Given a max-plus linear system and a semimodule, the problem of computing the maximal controlled invariant subsemimodule is still open to this day. In this paper, we consider this…
Consistency of P-time event graphs is decidable in polynomial time (extended version)
Davide Zorzenon, Jörg Raisch
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of ad…
Switched max-plus linear-dual inequalities: cycle time analysis and applications
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. Their dynamics can be represented by max-…
Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop
Davide Zorzenon, Nataliia Zaiets, Jörg Raisch
In this paper, an industrial bakery shop is modeled by switched max-plus linear-dual inequalities (SLDIs). SLDIs are timed discrete event systems suitable for describing flow shops…
Weak consistency of P-time event graphs
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. In this paper, we define a new property of PTEGs, c…
Switched Max-Plus Linear-Dual Inequalities: Application in Scheduling of Multi-Product Processing Networks
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. Their dynamics can be represented by syst…
The Hadamard product, its residual, and its dual residual in the dioid of counters: algorithms and implementation in C++
Davide Zorzenon, Germano Schafaschek, Dominik Tirpák +3
This report presents the algorithms for computing the Hadamard product, its residual, and its dual residual between formal power series in the dioid of counters. The algorithms hav…
Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
Davide Zorzenon, Jan Komenda, Joerg Raisch
P-time event graphs (P-TEGs) are specific timed discrete-event systems, in which the timing of events is constrained by intervals. An important problem is to check, for all natural…
The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
Davide Zorzenon, Jan Komenda, Joerg Raisch
Let us consider a parametric weighted directed graph in which every arc has weight of the form , where is a real parameter and…
Low Complexity Method for Simulation of Epidemics Based on Dijkstra's Algorithm
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. However, they come with high computational complexity…