Analysis of P-time event graphs in (max,+) and (min,+) semirings

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F21%3A00540650" target="_blank" >RIV/67985840:_____/21:00540650 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1080/00207721.2020.1837992" target="_blank" >https://doi.org/10.1080/00207721.2020.1837992</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/00207721.2020.1837992" target="_blank" >10.1080/00207721.2020.1837992</a>

Result language
angličtina
Original language name
Analysis of P-time event graphs in (max,+) and (min,+) semirings
Original language description
In this paper, we investigate the behaviour of P-time event graphs, a class of time Petri nets with non-deterministic timing of places. Our approach is based on combined linear descriptions in both (max,+) and (min,+) semirings, where lower bounds on the state vector are (max,+)-linear and upper bounds are (min,+)-linear. We present necessary and sufficient conditions for the existence of extremal (fastest and slowest) periodic trajectories that are derived from the new description. The results are illustrated by a realistic example of an electroplating process.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20205 - Automation and control systems

Project
<a href="/en/project/GC19-06175J" target="_blank" >GC19-06175J: Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)