Thierry Jéron, Hervé Marchand, Vlad Rusu. Symbolic Determinisation of Extended Automata. In Gonzalo Navarro, Leopoldo E. Bertossi, Yoshiharu Kohayakawa, editors, Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile. Volume 209 of IFIP, pages 197-212, Springer, 2006. [doi]
We define a symbolic determinisation procedure for a class of infinite-state systems, which consists of automata extended with symbolic variables that may be infinite-state. The subclass of extended automata for which the procedure terminates is characterised as bounded lookahead extended automata. It corresponds to automata for which, in any location, the observation of a bounded-length trace is enough to infer the first transition actually taken. We discuss applications of the algorithm to the verification, testing, and diagnosis of infinite-state systems.
Availablr at http://hal.inria.fr/docs/00/42/48/58/PDF/2006-TCS-Deter.pdf