Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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.
Thierry Jéron
Thierry.Jeron@irisa.fr
Hervé Marchand
hmarchan@irisa.fr
Vlad Rusu
Vlad.Rusu@irisa.fr
@TechReport{jeron-marchand-rusu-pi-deter-06,
Author = {Jéron, T. and Marchand, H. and Rusu, V.},
Title = {Symbolic Determinisation of Extended Automata },
Number = {1176},
Institution = {IRISA},
Month = {February},
Year = {2006}
}
Get EndNote Reference (.ref)