IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v51y2020i11p2041-2056.html
   My bibliography  Save this article

Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras

Author

Listed:
  • F. Ait Oumeziane
  • R. Kara
  • S. Amari

Abstract

This paper has introduced new formal approaches to model behaviours and control of a class of uncertain timed discrete event systems represented by Timed Automata with Guards (TAGs). We propose alternative representations for Timed Automata with Guards which approximate their dynamics, since only extremal behaviours are considered. More precisely, recursive equations are proposed in $(\max ,+) $(max,+) and $(\min , +) $(min,+) algebras to describe the worst and the optimistic behaviours. Thereafter, these developed linear models are used to treat a control problem of TAGs. Finally, the proposed methodologies are illustrated by a realistic study case that corresponds to a job-shop system.

Suggested Citation

  • F. Ait Oumeziane & R. Kara & S. Amari, 2020. "Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(11), pages 2041-2056, July.
    • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:11:p:2041-2056
    DOI: 10.1080/00207721.2020.1783590
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2020.1783590
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2020.1783590?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:51:y:2020:i:11:p:2041-2056. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.