Publicação
Regular expressions for timed automata
| Resumo: | Finite automata are valuable models for various types of software, such as system verifica-tion software and text search software, etc. A widely acclaimed result in computer science is the proof that finite automata can be represented through a notation structure called a regular expression. This means that regular expressions succeed in describing the same patterns that can be represented by a finite automaton. We know that it is difficult to prove that two finite automata are equivalent. Still, by converting them to a regular expression, you can determine relatively easily whether they represent the same language. Timed automata are an extension of finite automata with a finite set of clocks. Timed automata are widely used in model checking and also in real-time systems such as commu-nication and security protocols. In recent years there is an increasing demand for this type of software. As in classical automata, timed automata can also be represented by regular expressions. However, so far, there is no conversion software developed. There are two main methods for converting: the state elimination method; and the Brzozowski's method. These methods refer to the classic automaton model. The goal of this work is the study and development of an algorithm that converts a timed automaton into a timed regular expression. For this, i) we developed a conversion al-gorithm based on Brzozowski's method for timed automata adding to the classical case several changes, in particular, the incorporation of clocks and transition restrictions, among other, 2) we developed a software tool that converts a timed regular expression into a timed automaton, and depicting both of them. |
|---|---|
| Autores principais: | Ribeiro, Paulo |
| Assunto: | Algorithm Timed regular expression Brzozowski's method Software tool Algoritmo Expressões regulares temporais Método de Brzozowski Ferramenta de software |
| Ano: | 2021 |
| País: | Portugal |
| Tipo de documento: | dissertação de mestrado |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | Finite automata are valuable models for various types of software, such as system verifica-tion software and text search software, etc. A widely acclaimed result in computer science is the proof that finite automata can be represented through a notation structure called a regular expression. This means that regular expressions succeed in describing the same patterns that can be represented by a finite automaton. We know that it is difficult to prove that two finite automata are equivalent. Still, by converting them to a regular expression, you can determine relatively easily whether they represent the same language. Timed automata are an extension of finite automata with a finite set of clocks. Timed automata are widely used in model checking and also in real-time systems such as commu-nication and security protocols. In recent years there is an increasing demand for this type of software. As in classical automata, timed automata can also be represented by regular expressions. However, so far, there is no conversion software developed. There are two main methods for converting: the state elimination method; and the Brzozowski's method. These methods refer to the classic automaton model. The goal of this work is the study and development of an algorithm that converts a timed automaton into a timed regular expression. For this, i) we developed a conversion al-gorithm based on Brzozowski's method for timed automata adding to the classical case several changes, in particular, the incorporation of clocks and transition restrictions, among other, 2) we developed a software tool that converts a timed regular expression into a timed automaton, and depicting both of them. |
|---|