3 citations · 6 across the 5 of their papers we have counts for
5 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…
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…
Instability in Complex Oscillator Networks: Limitations and Potentials of Network Measures and Machine Learning
Christian Nauck, Michael Lindner, Nora Molkenthin +4
A central question of network science is how functional properties of systems emerge from their structure. For networked dynamical systems, structure is typically captured through…
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…
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…