Periodic trajectories in P-time event graphs and the non-positive circuit weight problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00543607" target="_blank" >RIV/67985840:_____/22:00543607 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/LCSYS.2021.3085521" target="_blank" >https://doi.org/10.1109/LCSYS.2021.3085521</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/LCSYS.2021.3085521" target="_blank" >10.1109/LCSYS.2021.3085521</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem

Popis výsledku v původním jazyce

P-time event graphs (P-TEGs) are specific timed discrete-event systems, in which the timing of events is constrained by intervals. In graph theory, the Proportional-Inverse-Constant-Non-positive Circuit weight Problem (PIC-NCP) consists in finding all the values of a parameter such that a particular parametric weighted directed graph does not contain circuits with positive weight. We show that given a natural number d, the existence of consistent d-periodic trajectories for a P-TEG can be formulated as an instance of the PIC-NCP, consequently, we prove that the same algorithm can be used to find d-periodic trajectories in P-TEGs. Morever, exploiting the connection between the PIC-NCP and maxplus algebra, we prove that the existence of a consistent 1-periodic trajectory of a certain period is a necessary and sufficient condition for the existence of a consistent d- periodic trajectory of the same period, for any value of d.

Název v anglickém jazyce

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem

Popis výsledku anglicky

P-time event graphs (P-TEGs) are specific timed discrete-event systems, in which the timing of events is constrained by intervals. In graph theory, the Proportional-Inverse-Constant-Non-positive Circuit weight Problem (PIC-NCP) consists in finding all the values of a parameter such that a particular parametric weighted directed graph does not contain circuits with positive weight. We show that given a natural number d, the existence of consistent d-periodic trajectories for a P-TEG can be formulated as an instance of the PIC-NCP, consequently, we prove that the same algorithm can be used to find d-periodic trajectories in P-TEGs. Morever, exploiting the connection between the PIC-NCP and maxplus algebra, we prove that the existence of a consistent 1-periodic trajectory of a certain period is a necessary and sufficient condition for the existence of a consistent d- periodic trajectory of the same period, for any value of d.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Control Systems Letters

ISSN

2475-1456

e-ISSN

—

Svazek periodika

6

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

6

Strana od-do

686-691

Kód UT WoS článku

000668835800032

EID výsledku v databázi Scopus

2-s2.0-85107333220