Weak consistency of P-time event graphs
Weak consistency of P-time event graphs
Weak consistency of P-time event graphs
Abstract
Abstract
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, called weak consistency. In weakly consistent P-TEGs, the amount of times a transition can fire before the first violation of a time constraint can be made as large as desired. We show the practical implications of this property and, based on previous results in graph theory, we formulate an algorithm of strongly polynomial time complexity that verifies it. From this algorithm, it is possible to determine, in pseudo-polynomial time, the maximum number of firings before the first constraint violation in a P-TEG.
Projects
Projects
Martin Trnečka
Jiří Balun, Jiří Valůšek
Verification and Control of Networked Discrete Event Systems
Verification and Control of Networked Discrete Event Systems
Tomáš Masopust, Jan Komenda
Jiří Balun, Stéphane Lafortune, Spyros Reveliotis, Feng Lin
Authors
Authors
Davide ZorzenonJiří Balun
Jörg Raisch
COSY, 2022
Accepted
Discrete-Event Systems and Theoretical Computer Science Research Group
Downloads
Downloads