Computational aspects of infinite automata simulation and closure system related issues

Abstract : This thesis investigates complexity and computational issues in two parts. The first concerns an issue related to web services composition problem: Deciding whether the behaviour of a web service can be composed out of an existing repository of web services. This question has been reduced to simulating a finite automata to the product closure of an automata set. We study the complexity of this problem considering two parameters; the number of considered instances in the composition and the presence of the so-called hybrid states (states that are both intermediate and final). The second part concerns closure systems and two related issues; Maximal extension of a closure system : we give an incremental polynomial algorithm that computes a lattice's maximal extension when the input is a binary relation. Candidate keys enumeration : we introduce the notion of key-ideal sets and prove that their enumeration is equivalent to candidate keys enumeration. We then give an efficient algorithm that generates all non-minimal key-ideal sets in a polynomial delay and all minimal ones in incremental polynomial time.
Document type :
Theses
Complete list of metadatas

Cited literature [49 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01807642
Contributor : Abes Star <>
Submitted on : Tuesday, June 5, 2018 - 8:33:30 AM
Last modification on : Monday, January 20, 2020 - 12:14:05 PM
Long-term archiving on: Thursday, September 6, 2018 - 1:26:13 PM

File

2017CLFAC031_ENNAOUI.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01807642, version 1

Collections

Citation

Karima Ennaoui. Computational aspects of infinite automata simulation and closure system related issues. Web. Université Clermont Auvergne, 2017. English. ⟨NNT : 2017CLFAC031⟩. ⟨tel-01807642⟩

Share

Metrics

Record views

172

Files downloads

117