News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Document

Symbolic determinisation of extended automata

Jéron, Thierry et al · SEDICI UNLP · 2006

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Jéron, Thierry et al
Publisher
SEDICI UNLP
Year
2006
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

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 extender 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. 4th IFIP International Conference on Theoretical Computer Science Red de Universidades con Carreras en Informática (RedUNCI)

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Jéron, T. E. A. (2006). Symbolic determinisation of extended automata. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/24398

MLA

Jéron, Thierry et al. Symbolic determinisation of extended automata. SEDICI UNLP, 2006. http://sedici.unlp.edu.ar/handle/10915/24398.

Chicago

Jéron, Thierry et al. 2006. Symbolic determinisation of extended automata. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/24398.

Harvard

Jéron, T. E. A. 2006, Symbolic determinisation of extended automata, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/24398 [Accessed 6 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Symbolic determinisation of extended automata
Author / contributors
Jéron, Thierry et al
Publisher
SEDICI UNLP
Publication year
2006
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; determinisation; symbolic automata
Copied