@article{NOURELFATH2006408,
    Abstract = {We present a generalization of the classical supervisory control theory for discrete event systems to a setting of dense real-time systems modeled by Alur and Dill timed automata. The main problem involved is that in general the state space of a timed automaton is (uncountably) infinite. The solution is to reduce the dense time transition system to an appropriate finite discrete subautomaton, the grid automaton, which contains enough information to deal with the timed supervisory control problem (TSCP). The plant and the specifications region graphs are sampled for a granularity defined in a way that each state has an outgoing transition labeled with the same time amount. We redefine the controllability concept in the context of grid automata, and we provide necessary and sufficient solvability conditions under which the optimal solution to centralized supervisory control problems in timed discrete event systems under full observation can be obtained. The enhanced setting admits subsystem composition and the concept of forcible event. A simple example illustrates how the new method can be used to solve the TSCP.},
    Author = {Nourelfath, Mustapha and Khoumsi, Ahmed},
    File = {Grid automata and supervisory control of dense real-time discrete event systems - nourelfath2006 - a - a - a - l.pdf},
    ISSN = {0378-4754},
    Journal = {Mathematics and Computers in Simulation},
    Keywords = {synthesis of timed systems},
    Note = {Computational Engineering in Systems Applications},
    Number = {5},
    Pages = {408 - 418},
    Title = {Grid automata and supervisory control of dense real-time discrete event systems},
    URL = {http://www.sciencedirect.com/science/article/pii/S037847540500251X},
    Volume = {70},
    Year = {2006},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S037847540500251X},
    bdsk-url-2 = {https://doi.org/10.1016/j.matcom.2005.11.009},
    date-added = {2020-02-06 13:03:40 +0100},
    date-modified = {2020-02-06 13:04:02 +0100},
    doi = {10.1016/j.matcom.2005.11.009}
}

@article{NOURELFATH2006408, Abstract = {We present a generalization of the classical supervisory control theory for discrete event systems to a setting of dense real-time systems modeled by Alur and Dill timed automata. The main problem involved is that in general the state space of a timed automaton is (uncountably) infinite. The solution is to reduce the dense time transition system to an appropriate finite discrete subautomaton, the grid automaton, which contains enough information to deal with the timed supervisory control problem (TSCP). The plant and the specifications region graphs are sampled for a granularity defined in a way that each state has an outgoing transition labeled with the same time amount. We redefine the controllability concept in the context of grid automata, and we provide necessary and sufficient solvability conditions under which the optimal solution to centralized supervisory control problems in timed discrete event systems under full observation can be obtained. The enhanced setting admits subsystem composition and the concept of forcible event. A simple example illustrates how the new method can be used to solve the TSCP.}, Author = {Nourelfath, Mustapha and Khoumsi, Ahmed}, File = {Grid automata and supervisory control of dense real-time discrete event systems - nourelfath2006 - a - a - a - l.pdf}, ISSN = {0378-4754}, Journal = {Mathematics and Computers in Simulation}, Keywords = {synthesis of timed systems}, Note = {Computational Engineering in Systems Applications}, Number = {5}, Pages = {408 - 418}, Title = {Grid automata and supervisory control of dense real-time discrete event systems}, URL = {http://www.sciencedirect.com/science/article/pii/S037847540500251X}, Volume = {70}, Year = {2006}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S037847540500251X}, bdsk-url-2 = {https://doi.org/10.1016/j.matcom.2005.11.009}, date-added = {2020-02-06 13:03:40 +0100}, date-modified = {2020-02-06 13:04:02 +0100}, doi = {10.1016/j.matcom.2005.11.009} }