Switched max-plus linear-dual inequalities: cycle time analysis and applications
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00582950" target="_blank" >RIV/67985840:_____/24:00582950 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10626-023-00389-5" target="_blank" >https://doi.org/10.1007/s10626-023-00389-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10626-023-00389-5" target="_blank" >10.1007/s10626-023-00389-5</a>
Alternative languages
Result language
angličtina
Original language name
Switched max-plus linear-dual inequalities: cycle time analysis and applications
Original language description
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-plus linear-dual inequalities (LDIs), i.e., systems of linear dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches, ii. a complete trajectory of the robot including start-up and shut-down transients.
Czech name
—
Czech description
—
Classification
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
Result continuities
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
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Event Dynamic Systems-Theory and Applications
ISSN
0924-6703
e-ISSN
1573-7594
Volume of the periodical
34
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
52
Pages from-to
199-250
UT code for WoS article
001152304200001
EID of the result in the Scopus database
2-s2.0-85183865098