Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10626-019-00309-6 | Discrete Event Dynamic Systems |
Keywords | Field | DocType |
Weighted automata, Max-plus algebra, Determinization | Discrete mathematics,Automaton,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 1 | 0924-6703 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sébastien Lahaye | 1 | 1 | 0.35 |
| Aiwen Lai | 2 | 1 | 0.35 |
| Jan Komenda | 3 | 147 | 21.85 |
| Jean-Louis Boimond | 4 | 152 | 20.21 |