PLC-Automaton Composition

Type of content
Discussion / Working Papers
Publisher's DOI/URI
Thesis discipline
Degree name
Bachelor of Science with Honours
Publisher
University of Canterbury. Computer Science
Journal Title
Journal ISSN
Volume Title
Language
Date
1999
Authors
Renaud, André
Abstract

Based on a discussion of timed automata and a subset of these called PLC automata, described by H. Dierks, the problem of the composition of PLC automata is presented. Two methods for performing this composition are described, synchronous and asynchronous. The synchronous method requires that if and only if both initial automata accept a timed word, then it will appear in the resultant automaton. However, we prove that PLC automata are not closed under this form of composition. From this we introduce the asynchronous composition, which requires synchronization on the symbol element of the timed word alone. Four possible methods of asynchronous composition are described, and their effects on the 'essential' language, the language containing only words with no ignored symbols, are discussed. A few elementary results are also presented.

Description
Citation
Keywords
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Field of Research::08 - Information and Computing Sciences
Rights
Copyright André Renaud