A contribution to the determinization of max-plus automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F20%3A00522961" target="_blank" >RIV/67985840:_____/20:00522961 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10626-019-00309-6" target="_blank" >https://doi.org/10.1007/s10626-019-00309-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10626-019-00309-6" target="_blank" >10.1007/s10626-019-00309-6</a>

Result language
angličtina
Original language name
A contribution to the determinization of max-plus automata
Original language description
It is a well known fact that not all max-plus automata can be determinized, i.e. transformed into deterministic max-plus automata with the same behavior. A classical sequentialization procedure, extended in the literature to max-plus automata, succeeds in computing an equivalent deterministic max-plus automaton for important subclasses of max-plus automata. This procedure is based on the normalization of state vectors in order to detect and merge states which have similar future behavior. In this paper, a novel and weaker condition is proposed that still guarantees this property. This allows for a considerable improvement of the existing determinization procedure, because it terminates for a larger class of max-plus automata.
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
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)