Symbolic Determinisation of Extended Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Symbolic Determinisation of Extended Automata


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
Fichier principal
Vignette du fichier
2006-TCS-Deter.pdf (242.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00424858 , version 1 (19-10-2009)



Thierry Jéron, Hervé Marchand, Vlad Rusu. Symbolic Determinisation of Extended Automata. 4th IFIP International Conference on Theoretical Computer Science, Aug 2006, Stantiago, Chile, Chile. pp.197-212, ⟨10.1007/978-0-387-34735-6_18⟩. ⟨inria-00424858⟩
82 View
143 Download



Gmail Facebook Twitter LinkedIn More