Supervisory control of (max,+) automata: extensions towards applications

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

Result language
angličtina
Original language name
Supervisory control of (max,+) automata: extensions towards applications
Original language description
In this paper, supervisory control of (max,+) automata is studied. The synthesis of maximally permissive and just-in-time supervisor, as well as the synthesis of minimally permissive and just-after-time supervisor, are proposed. Results are also specialized to nondecreasing solutions, because only such supervisors can be realized in practice. The inherent issue of rationality raised recently is discussed. An illustration of concepts and results is presented through an example of a flexible manufacturingsystem.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)