10 Search Results for "Traverso, Paolo"

Document
DOI: 10.4230/LIPIcs.SWAT.2026.12
Strategy Repair in Reachability Games via a Graph Quotientation

Authors: Tiziana Calamoneri, Pierre Gaillard, Giacomo Paesani, and Giuseppe Perelli

Published in: LIPIcs, Volume 370, 20th Scandinavian Symposium on Algorithm Theory (SWAT 2026)

Abstract
Reachability Games over graphs (RGs) are a powerful modelling tool for synthesis and planning. The solutions to RGs are strategies that are used in program design. Sometimes, due to model deviation at execution time, specification updates, or simply a bug, the strategy provided as a solution to an RG no longer works. Strategy Repair aims to solve this problem by adjusting strategies with a minimum number of modifications. Such a minimisation requirement is motivated by the costs that one may incur when implementing the new strategy. To minimise implementation costs, one wants to reuse as much of the provided strategy as possible. In the literature, Strategy Repair has been investigated from both theoretical and practical perspectives. First, it has been shown to be NP-complete. Second, two algorithmic approaches have been proposed to tackle the problem in practice, one provides an optimal solution, the other an approximated solution. Both approaches underutilise the graph-theoretical properties of games, which could significantly improve their performance and accuracy (in the case of approximation algorithms). This paper provides a graph-theoretic characterisation of Strategy Repair that provably improves every algorithmic approach to solving the problem. It does so by introducing a new notion of quotient graph that allows us to identify and merge those vertices that are equivalent from the perspective of every solution to the problem. This way, solving Strategy Repair can be done in a reduced instance, which we call the quotient game. The approach not only reduces the problem’s input size, but also improves the effectiveness of MustFix, an optimisation condition previously introduced for the problem. Besides the theoretical characterisation, we test our approach empirically by running experiments to demonstrate improvements over the quotient graph approach.
Cite as

Tiziana Calamoneri, Pierre Gaillard, Giacomo Paesani, and Giuseppe Perelli. Strategy Repair in Reachability Games via a Graph Quotientation. In 20th Scandinavian Symposium on Algorithm Theory (SWAT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 370, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{calamoneri_et_al:LIPIcs.SWAT.2026.12,
  author =	{Calamoneri, Tiziana and Gaillard, Pierre and Paesani, Giacomo and Perelli, Giuseppe},
  title =	{{Strategy Repair in Reachability Games via a Graph Quotientation}},
  booktitle =	{20th Scandinavian Symposium on Algorithm Theory (SWAT 2026)},
  pages =	{12:1--12:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-421-5},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{370},
  editor =	{Fraigniaud, Pierre},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.12},
  URN =		{urn:nbn:de:0030-drops-260481},
  doi =		{10.4230/LIPIcs.SWAT.2026.12},
  annote =	{Keywords: Reachability Games, Strategy Repair, Strategic Reasoning, Automated Reasoning}
}
Document
Research
DOI: 10.4230/TGDK.4.1.4
Native Provenance Computation for Federated and Non-Federated SPARQL Queries

Authors: Zubaria Asma, Daniel Hernández, Luis Galárraga, Giorgos Flouris, Irini Fundulaki, and Katja Hose

Published in: TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1

Abstract
The popularity of knowledge graphs (KGs) owes credit to their flexible data model, which is suitable for data integration from multiple sources. Several KG-based applications, such as trust assessment, view maintenance, or data valuation on dynamic data, rely on the ability to compute provenance explanations for query results. This need becomes more urgent in federated query processing systems, which allow the online consumption of heterogeneous and decentralized Web data. However, the problem of computing and interacting with provenance has received little attention, especially in the federated setting. On those grounds, this paper introduces the NPCS (Native Provenance Computation for SPARQL) approach, and its federated variant Fed-NPCS, that compute provenance for SPARQL query results. Both approaches build upon spm-semirings to annotate the results of monotonic and non-monotonic SPARQL queries with their provenance. Due to their reliance on query rewriting techniques, the approaches are directly applicable to already deployed SPARQL engines and federations using different reification schemes, including RDF-star. Our experimental evaluation shows that our novel query rewriting approach brings significant run-time improvements w.r.t. the state-of-the-art across both centralized and federated settings. In centralized settings, our tests on two popular SPARQL engines (GraphDB and Stardog) reveal substantial runtime gains over existing query rewriting solutions, enabling scalability to RDF graphs with billions of triples. In federated settings, our experiments on the FedShop benchmark with GraphDB show the viability of Fed-NPCS for federations with up to 200 sources.
Cite as

Zubaria Asma, Daniel Hernández, Luis Galárraga, Giorgos Flouris, Irini Fundulaki, and Katja Hose. Native Provenance Computation for Federated and Non-Federated SPARQL Queries. In Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 1, pp. 4:1-4:43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@Article{asma_et_al:TGDK.4.1.4,
  author =	{Asma, Zubaria and Hern\'{a}ndez, Daniel and Gal\'{a}rraga, Luis and Flouris, Giorgos and Fundulaki, Irini and Hose, Katja},
  title =	{{Native Provenance Computation for Federated and Non-Federated SPARQL Queries}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{4:1--4:43},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.4},
  URN =		{urn:nbn:de:0030-drops-259642},
  doi =		{10.4230/TGDK.4.1.4},
  annote =	{Keywords: native provenance computation, federated SPARQL queries, data provenance, NPCS, Fed-NPCS}
}
Document
DOI: 10.4230/LIPIcs.TIME.2025.7
PDDL to DFA: A Symbolic Transformation for Effective Reasoning

Authors: Giuseppe De Giacomo, Antonio Di Stasio, and Gianmarco Parretti

Published in: LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)

Abstract
ltl_f reactive synthesis under environment specifications, which concerns the automated generation of strategies enforcing logical specifications, has emerged as a powerful technique for developing autonomous AI systems. It shares many similarities with Fully Observable Nondeterministic (fond) planning. In particular, nondeterministic domains can be expressed as ltl_f environment specifications. However, this is not needed since nondeterministic domains can be transformed into deterministic finite-state automata (dfa) to be used directly in the synthesis process. In this paper, we present a practical symbolic technique for translating domains expressed in Planning Domain Definition Language (pddl) into dfas. The technique allows for the integration of the planning domain, reduced to dfa in a symbolic form, into current symbolic ltl_f synthesis tools. We implemented our technique in a new tool, pddl2dfa, and applied it to solve fond planning by using state-of-the-art reactive synthesis techniques in a tool called syft4fond. Our empirical results confirm the effectiveness of our approach.
Cite as

Giuseppe De Giacomo, Antonio Di Stasio, and Gianmarco Parretti. PDDL to DFA: A Symbolic Transformation for Effective Reasoning. In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{degiacomo_et_al:LIPIcs.TIME.2025.7,
  author =	{De Giacomo, Giuseppe and Di Stasio, Antonio and Parretti, Gianmarco},
  title =	{{PDDL to DFA: A Symbolic Transformation for Effective Reasoning}},
  booktitle =	{32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)},
  pages =	{7:1--7:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-401-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{355},
  editor =	{Vidal, Thierry and Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.7},
  URN =		{urn:nbn:de:0030-drops-244532},
  doi =		{10.4230/LIPIcs.TIME.2025.7},
  annote =	{Keywords: Fully Observable Nondeterministic Planning, Linear Temporal Logics on finite traces, Reactive Synthesis, DFA}
}
Document
Survey
DOI: 10.4230/TGDK.1.1.11
How Does Knowledge Evolve in Open Knowledge Graphs?

Authors: Axel Polleres, Romana Pernisch, Angela Bonifati, Daniele Dell'Aglio, Daniil Dobriy, Stefania Dumbrava, Lorena Etcheverry, Nicolas Ferranti, Katja Hose, Ernesto Jiménez-Ruiz, Matteo Lissandrini, Ansgar Scherp, Riccardo Tommasini, and Johannes Wachs

Published in: TGDK, Volume 1, Issue 1 (2023): Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge, Volume 1, Issue 1

Abstract
Openly available, collaboratively edited Knowledge Graphs (KGs) are key platforms for the collective management of evolving knowledge. The present work aims t o provide an analysis of the obstacles related to investigating and processing specifically this central aspect of evolution in KGs. To this end, we discuss (i) the dimensions of evolution in KGs, (ii) the observability of evolution in existing, open, collaboratively constructed Knowledge Graphs over time, and (iii) possible metrics to analyse this evolution. We provide an overview of relevant state-of-the-art research, ranging from metrics developed for Knowledge Graphs specifically to potential methods from related fields such as network science. Additionally, we discuss technical approaches - and their current limitations - related to storing, analysing and processing large and evolving KGs in terms of handling typical KG downstream tasks.
Cite as

Axel Polleres, Romana Pernisch, Angela Bonifati, Daniele Dell'Aglio, Daniil Dobriy, Stefania Dumbrava, Lorena Etcheverry, Nicolas Ferranti, Katja Hose, Ernesto Jiménez-Ruiz, Matteo Lissandrini, Ansgar Scherp, Riccardo Tommasini, and Johannes Wachs. How Does Knowledge Evolve in Open Knowledge Graphs?. In Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 1, Issue 1, pp. 11:1-11:59, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{polleres_et_al:TGDK.1.1.11,
  author =	{Polleres, Axel and Pernisch, Romana and Bonifati, Angela and Dell'Aglio, Daniele and Dobriy, Daniil and Dumbrava, Stefania and Etcheverry, Lorena and Ferranti, Nicolas and Hose, Katja and Jim\'{e}nez-Ruiz, Ernesto and Lissandrini, Matteo and Scherp, Ansgar and Tommasini, Riccardo and Wachs, Johannes},
  title =	{{How Does Knowledge Evolve in Open Knowledge Graphs?}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{11:1--11:59},
  year =	{2023},
  volume =	{1},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.1.1.11},
  URN =		{urn:nbn:de:0030-drops-194855},
  doi =		{10.4230/TGDK.1.1.11},
  annote =	{Keywords: KG evolution, temporal KG, versioned KG, dynamic KG}
}
Document
DOI: 10.4230/DagSemProc.07061.1
07061 Abstracts Collection – Autonomous and Adaptive Web Services

Authors: Jana Koehler, Marco Pistore, Amit P. Sheth, Paolo Traverso, and Martin Wirsing

Published in: Dagstuhl Seminar Proceedings, Volume 7061, Autonomous and Adaptive Web Services (2007)

Abstract
From 4.2.2007 to 9.2.2007, the Dagstuhl Seminar 07061 ``Autonomous and Adaptive Web Services'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Jana Koehler, Marco Pistore, Amit P. Sheth, Paolo Traverso, and Martin Wirsing. 07061 Abstracts Collection – Autonomous and Adaptive Web Services. In Autonomous and Adaptive Web Services. Dagstuhl Seminar Proceedings, Volume 7061, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{koehler_et_al:DagSemProc.07061.1,
  author =	{Koehler, Jana and Pistore, Marco and Sheth, Amit P. and Traverso, Paolo and Wirsing, Martin},
  title =	{{07061 Abstracts Collection – Autonomous and Adaptive Web Services}},
  booktitle =	{Autonomous and Adaptive Web Services},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7061},
  editor =	{Jana Koehler and Marco Pistore and Amit P. Sheth and Paolo Traverso and Martin Wirsing},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07061.1},
  URN =		{urn:nbn:de:0030-drops-10359},
  doi =		{10.4230/DagSemProc.07061.1},
  annote =	{Keywords: Intelligent Web Services and Semantic Web, Software Architectures, Distributed Systems, Program Verification, Interoperability}
}
Document
DOI: 10.4230/DagSemProc.07061.2
ASG - Techniques of Adaptivity

Authors: Harald Meyer, Dominik Kuropka, and Peter Tröger

Published in: Dagstuhl Seminar Proceedings, Volume 7061, Autonomous and Adaptive Web Services (2007)

Abstract
The introduction of service-orientation leads to significant improvements regarding flexibility in the choice of business partners and IT-systems. This requires an increased adaptability of enterprise software landscapes as the environment is more dynamic than the ones in traditional approaches. In this paper we present different types of adaptation scenarios for service compositions and their implementation in a service provision platform. Based on experiences from the Adaptive Services Grid (ASG) project, we show how dynamic adaptation strategies are able to support an automated selection, composition and binding of services during run-time.
Cite as

Harald Meyer, Dominik Kuropka, and Peter Tröger. ASG - Techniques of Adaptivity. In Autonomous and Adaptive Web Services. Dagstuhl Seminar Proceedings, Volume 7061, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{meyer_et_al:DagSemProc.07061.2,
  author =	{Meyer, Harald and Kuropka, Dominik and Tr\"{o}ger, Peter},
  title =	{{ASG - Techniques of Adaptivity}},
  booktitle =	{Autonomous and Adaptive Web Services},
  pages =	{1--19},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7061},
  editor =	{Jana Koehler and Marco Pistore and Amit P. Sheth and Paolo Traverso and Martin Wirsing},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07061.2},
  URN =		{urn:nbn:de:0030-drops-10361},
  doi =		{10.4230/DagSemProc.07061.2},
  annote =	{Keywords: Adaptive service provision, service selection, automated service composition, service recovery}
}
Document
DOI: 10.4230/DagSemProc.07061.3
Composing Web-service-like abstract state machines (ASM)

Authors: Andreas Friesen and Lemcke Jens

Published in: Dagstuhl Seminar Proceedings, Volume 7061, Autonomous and Adaptive Web Services (2007)

Abstract
The presentation provides an overview on semi-automatic design of Collaborative Business Processes for B2B/EAI integration in the EU project FUSION. The introduced Enterprise Application Integration Ontology and a mediator-based run-time architecture for CBPs integrating heterogeneous web services enabled enterprise systems build the corner stones of the FUSION solution. The functionality and the building blocks of the Collaborative Business Process Designer are discussed in detail. The talk provides then an example demonstrating initial ideas for generating an executable collaborative business process out of a CBP template automatically.
Cite as

Andreas Friesen and Lemcke Jens. Composing Web-service-like abstract state machines (ASM). In Autonomous and Adaptive Web Services. Dagstuhl Seminar Proceedings, Volume 7061, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{friesen_et_al:DagSemProc.07061.3,
  author =	{Friesen, Andreas and Lemcke Jens},
  title =	{{Composing Web-service-like abstract state machines (ASM)}},
  booktitle =	{Autonomous and Adaptive Web Services},
  pages =	{1--30},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7061},
  editor =	{Jana Koehler and Marco Pistore and Amit P. Sheth and Paolo Traverso and Martin Wirsing},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07061.3},
  URN =		{urn:nbn:de:0030-drops-10348},
  doi =		{10.4230/DagSemProc.07061.3},
  annote =	{Keywords: Business process composition, collaborative business processes, Web service composition, enterprise application integration, business-to-business inte}
}
Document
DOI: 10.4230/DagSemProc.07061.4
Role of semantics in Autonomic and Adaptive Web Services & Processes

Authors: Amit P. Sheth

Published in: Dagstuhl Seminar Proceedings, Volume 7061, Autonomous and Adaptive Web Services (2007)

Abstract
The emergence of Service Oriented Architectures (SOA) has created a new paradigm of loosely coupled distributed systems. In the METEOR-S project, we have studied the comprehensive role of semantics in all stages of the life cycle of service and process-- including annotation, publication, discovery, interoperability/data mediation, and composition. In 2002-2003, we had offered a broad framework of semantics consisting of four types:1) Data semantics, 2) Functional semantics, 3) Non-Functional semantics and 4) Execution semantics. This talk describes the need for the four types of semantics, its standards-based support through WSDL-S/SAWSDL, and the need for such semantic representation to dynamic and adaptive SOA. We also briefly review the proposal for Adaptive Web Processes introduced earlier in a ICSOC 2005 vision talk.
Cite as

Amit P. Sheth. Role of semantics in Autonomic and Adaptive Web Services & Processes. In Autonomous and Adaptive Web Services. Dagstuhl Seminar Proceedings, Volume 7061, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{sheth:DagSemProc.07061.4,
  author =	{Sheth, Amit P.},
  title =	{{Role of semantics in Autonomic and Adaptive Web Services \& Processes}},
  booktitle =	{Autonomous and Adaptive Web Services},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7061},
  editor =	{Jana Koehler and Marco Pistore and Amit P. Sheth and Paolo Traverso and Martin Wirsing},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07061.4},
  URN =		{urn:nbn:de:0030-drops-10325},
  doi =		{10.4230/DagSemProc.07061.4},
  annote =	{Keywords: Adaptive web service, autonomic web service, adaptive web process, autonomic web process, data semantics, functional semantics, non-functional semanti}
}
Document
DOI: 10.4230/DagSemProc.07061.5
Towards Analyzing Declarative Workflows

Authors: Dirk Fahland

Published in: Dagstuhl Seminar Proceedings, Volume 7061, Autonomous and Adaptive Web Services (2007)

Abstract
Enacting tasks in a workflow cannot always follow a pre-defined process model. In application domains like disaster management workflows are partially specified and circumstances of their enactment change. There exist various approaches for formal workflow models that are effective in such situations, like declarative specifications instead of operational models for formalizing flexible workflow process. These powerful models leave a gap to existing techniques in the domain of workflow modeling, workflow analysis, and workflow management. In this paper we bridge this gap with a compositional mechanism for translating declarative workflow models to operational workflow models. The mechanism is of a general nature and we reveal its principles as we provide an exemplary definition for translating DecSerFlow models based on LTL to Petri nets. We then demonstrate its use in analyzing and refining declarative models.
Cite as

Dirk Fahland. Towards Analyzing Declarative Workflows. In Autonomous and Adaptive Web Services. Dagstuhl Seminar Proceedings, Volume 7061, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{fahland:DagSemProc.07061.5,
  author =	{Fahland, Dirk},
  title =	{{Towards Analyzing Declarative Workflows}},
  booktitle =	{Autonomous and Adaptive Web Services},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7061},
  editor =	{Jana Koehler and Marco Pistore and Amit P. Sheth and Paolo Traverso and Martin Wirsing},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07061.5},
  URN =		{urn:nbn:de:0030-drops-10332},
  doi =		{10.4230/DagSemProc.07061.5},
  annote =	{Keywords: Workflow, declarative, temporal logic, flexible, adaptive, analysis, transformation, Petri net}
}
Document
DOI: 10.4230/DagSemProc.05462.4
05462 Service-Oriented Computing: A Research Roadmap

Authors: Michael P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann, and Bernd J. Krämer

Published in: Dagstuhl Seminar Proceedings, Volume 5462, Service Oriented Computing (SOC) (2006)

Abstract
This document presents a Services Research Roadmap that launches four pivotal, inherently related, research themes to Service-Oriented Computing (SOC): service foundations, service composition, service management and monitoring and service-oriented engineering. Each theme is introduced briefly from a technology, state of the art and scientific challenges standpoint. From the technology standpoint a comprehensive review of state of the art, standards, and current research activities in each key area is provided. From the state of the art the major open problems and bottlenecks to progress are identified. During the during seminar each core theme was initially introduced by a leading expert in the field who described the state of the art and highlighting open problems and important research topics for the SOC community to work on in the future. These experts were then asked to coordinate parallel workgroups that were entrusted with an in-depth analysis of the research opportunities and needs in the respective theme. The findings presented in this summary report build on the advice of those panels of experts from industry and academia who participated in this Dagstuhl Seminar and met at other occasions during the past three years, e.g., at the International Conference on Service Oriented Computing (ICSOC, see www.icsoc.org). These experts represent many disciplines including distributed computing, database and information systems, software engineering, computer architectures and middleware and knowledge representation.
Cite as

Michael P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann, and Bernd J. Krämer. 05462 Service-Oriented Computing: A Research Roadmap. In Service Oriented Computing (SOC). Dagstuhl Seminar Proceedings, Volume 5462, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{papazoglou_et_al:DagSemProc.05462.4,
  author =	{Papazoglou, Michael P. and Traverso, Paolo and Dustdar, Schahram and Leymann, Frank and Kr\"{a}mer, Bernd J.},
  title =	{{05462 Service-Oriented Computing: A Research Roadmap}},
  booktitle =	{Service Oriented Computing (SOC)},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5462},
  editor =	{Francisco Cubera and Bernd J. Kr\"{a}mer and Michael P. Papazoglou},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05462.4},
  URN =		{urn:nbn:de:0030-drops-5242},
  doi =		{10.4230/DagSemProc.05462.4},
  annote =	{Keywords: Service-oriented computing, research road map, service foundations, service composition, service management, service monitoring, service-oriented engi}
}
  • Refine by Type
  • 10 Document/PDF
  • 3 Document/HTML

  • Refine by Publication Year
  • 2 2026
  • 1 2025
  • 1 2023
  • 5 2007
  • 1 2006

  • Refine by Author
  • 2 Hose, Katja
  • 2 Sheth, Amit P.
  • 2 Traverso, Paolo
  • 1 Asma, Zubaria
  • 1 Bonifati, Angela
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs
  • 2 TGDK
  • 6 DagSemProc

  • Refine by Classification
  • 1 Computing methodologies → Planning and scheduling
  • 1 Computing methodologies → Symbolic and algebraic manipulation
  • 1 Information systems → Data provenance
  • 1 Information systems → Data streaming
  • 1 Information systems → Graph-based database models
  • Show More...

  • Refine by Keyword
  • 1 Adaptive service provision
  • 1 Adaptive web service
  • 1 Automated Reasoning
  • 1 Business process composition
  • 1 DFA
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact