dc.contributor.advisor | Neruda, Roman | |
dc.creator | Vaculín, Roman | |
dc.date.accessioned | 2021-01-15T17:41:25Z | |
dc.date.available | 2021-01-15T17:41:25Z | |
dc.date.issued | 2009 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11956/24376 | |
dc.description.abstract | The goal of Web services is to enable interoperability of heterogeneous software systems. Semantic Web services enhance syntactic specifications of traditional Web services with machine processable semantic annotations to facilitate interoperability. AsWeb services get popular in both corporate and open environments, the ability to deal with uncompatibilities of service requesters and providers becomes a critical factor for achieving interoperability. Process mediation solves the problem of interoperability by identifying and resolving all incompatibilities and by mediating between service requesters and providers. In this thesis we address the problem of process mediation of Semantic Web services. We introduce an Abstract Process Mediation Framework that identifies the key functional areas to be addressed by process mediation components. Specifically, we focus on process mediation algorithms, discovery of external services, monitoring, and fault handling and recovery. We present algorithms for solving the process mediation problem in two scenarios: (a) when the mediation process has complete visibility of the process model of the service provider and the service requester (complete visibility scenario), and (b) when the mediation process has visibility only of the process model of the service provider but... | en_US |
dc.language | English | cs_CZ |
dc.language.iso | en_US | |
dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
dc.title | Process Mediation Framework for Semantic Web Services | en_US |
dc.type | dizertační práce | cs_CZ |
dcterms.created | 2009 | |
dcterms.dateAccepted | 2009-09-25 | |
dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
dc.description.faculty | Faculty of Mathematics and Physics | en_US |
dc.identifier.repId | 41051 | |
dc.title.translated | Framework pro procesní mediaci semantických webových služeb | cs_CZ |
dc.contributor.referee | Nečaský, Martin | |
dc.contributor.referee | Svátek, Vojtěch | |
dc.identifier.aleph | 001200618 | |
thesis.degree.name | Ph.D. | |
thesis.degree.level | doktorské | cs_CZ |
thesis.degree.discipline | Theoretical Computer Science | en_US |
thesis.degree.discipline | Teoretická informatika | cs_CZ |
thesis.degree.program | Informatics | en_US |
thesis.degree.program | Informatika | cs_CZ |
uk.thesis.type | dizertační práce | cs_CZ |
uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
uk.faculty-abbr.cs | MFF | cs_CZ |
uk.degree-discipline.cs | Teoretická informatika | cs_CZ |
uk.degree-discipline.en | Theoretical Computer Science | en_US |
uk.degree-program.cs | Informatika | cs_CZ |
uk.degree-program.en | Informatics | en_US |
thesis.grade.cs | Prospěl/a | cs_CZ |
thesis.grade.en | Pass | en_US |
uk.abstract.en | The goal of Web services is to enable interoperability of heterogeneous software systems. Semantic Web services enhance syntactic specifications of traditional Web services with machine processable semantic annotations to facilitate interoperability. AsWeb services get popular in both corporate and open environments, the ability to deal with uncompatibilities of service requesters and providers becomes a critical factor for achieving interoperability. Process mediation solves the problem of interoperability by identifying and resolving all incompatibilities and by mediating between service requesters and providers. In this thesis we address the problem of process mediation of Semantic Web services. We introduce an Abstract Process Mediation Framework that identifies the key functional areas to be addressed by process mediation components. Specifically, we focus on process mediation algorithms, discovery of external services, monitoring, and fault handling and recovery. We present algorithms for solving the process mediation problem in two scenarios: (a) when the mediation process has complete visibility of the process model of the service provider and the service requester (complete visibility scenario), and (b) when the mediation process has visibility only of the process model of the service provider but... | en_US |
uk.file-availability | V | |
uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
thesis.grade.code | P | |
uk.publication-place | Praha | cs_CZ |
uk.thesis.defenceStatus | O | |
uk.departmentExternal.name | Ústav informatiky AV ČR, v.v.i. | cs |
dc.identifier.lisID | 990012006180106986 | |