Controllability of (max,+) Formal Power Series*

Controllability of (max,+) automata and formal power series is studied within a behavioral framework. An extension of classical tensor product of their linear representations as a parallel composition of controller with the plant (max,+) automaton is used. Controllability is studied using residuation theory of (multivariable) formal power series and (max,+)-counterpats of supremal controllable behaviors are derived.