DROPS

Document

DOI: 10.4230/LIPIcs.CSL.2026.26

ε-Distance via Lévy-Prokhorov Lifting

Authors: Josée Desharnais and Ana Sokolova

Published in: LIPIcs, Volume 363, 34th EACSL Annual Conference on Computer Science Logic (CSL 2026)

Abstract

The most studied and accepted pseudometric for probabilistic processes is one based on the Kantorovich distance between distributions. It comes with many theoretical and motivating results, in particular it is the fixpoint of a given functional and defines a functor on (complete) pseudometric spaces. It is also the foundation for a categorical lifting of pseudometrics. Other notions of behavioural pseudometrics have also been proposed, one of them (ε-distance) based on ε-bisimulation. ε-Distance has the advantages that it is intuitively easy to understand, it relates systems that are conceptually close (for example, an imperfect implementation is close to its specification), and it comes equipped with a natural notion of ε-coupling. Finally, this distance is easy to compute. We show that ε-distance is also the greatest fixpoint of a functional and provides a functor. The latter is obtained by replacing the Kantorovich distance in the lifting functor with the Lévy-Prokhorov distance. In addition, we show that ε-couplings and ε-bisimulations have an appealing coalgebraic characterization.

Cite as

Josée Desharnais and Ana Sokolova. ε-Distance via Lévy-Prokhorov Lifting. In 34th EACSL Annual Conference on Computer Science Logic (CSL 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 363, pp. 26:1-26:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{desharnais_et_al:LIPIcs.CSL.2026.26,
  author =	{Desharnais, Jos\'{e}e and Sokolova, Ana},
  title =	{{\epsilon-Distance via L\'{e}vy-Prokhorov Lifting}},
  booktitle =	{34th EACSL Annual Conference on Computer Science Logic (CSL 2026)},
  pages =	{26:1--26:24},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-411-6},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{363},
  editor =	{Guerrini, Stefano and K\"{o}nig, Barbara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.26},
  URN =		{urn:nbn:de:0030-drops-254506},
  doi =		{10.4230/LIPIcs.CSL.2026.26},
  annote =	{Keywords: L\'{e}vy-Prokhorov metric, behavioural distance, epsilon-bisimulation, reactive probabilistic transition systems, discrete labelled Markov processes, coalgebraic epsilon-(bi)simulation}
}

Document

DOI: 10.4230/LIPIcs.DISC.2025.30

Team Formation and Applications

Authors: Yuval Emek, Shay Kutten, Ido Rafael, and Gadi Taubenfeld

Published in: LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025)

Abstract

A novel long-lived distributed problem, called Team Formation (TF), is introduced together with a message- and time-efficient randomized algorithm. The problem is defined over the asynchronous model with a complete communication graph, using bounded size messages, where a certain fraction of the nodes may experience a generalized, strictly stronger, version of initial failures. The goal of a TF algorithm is to assemble tokens injected by the environment, in a distributed manner, into teams of size σ, where σ is a parameter of the problem. The usefulness of TF is demonstrated by using it to derive efficient algorithms for many distributed problems. Specifically, we show that various (one-shot as well as long-lived) distributed problems reduce to TF. This includes well-known (and extensively studied) distributed problems such as several versions of leader election and threshold detection. For example, we are the first to break the linear message complexity bound for asynchronous implicit leader election. We also improve the time complexity of message-optimal algorithms for asynchronous explicit leader election. Other distributed problems that reduce to TF are new ones, including matching players in online gaming platforms, a generalization of gathering, constructing a perfect matching in an induced subgraph of the complete graph, and more. To complement our positive contribution, we establish a tight lower bound on the message complexity of TF algorithms.

Cite as

Yuval Emek, Shay Kutten, Ido Rafael, and Gadi Taubenfeld. Team Formation and Applications. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 30:1-30:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{emek_et_al:LIPIcs.DISC.2025.30,
  author =	{Emek, Yuval and Kutten, Shay and Rafael, Ido and Taubenfeld, Gadi},
  title =	{{Team Formation and Applications}},
  booktitle =	{39th International Symposium on Distributed Computing (DISC 2025)},
  pages =	{30:1--30:25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-402-4},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{356},
  editor =	{Kowalski, Dariusz R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.30},
  URN =		{urn:nbn:de:0030-drops-248474},
  doi =		{10.4230/LIPIcs.DISC.2025.30},
  annote =	{Keywords: asynchronous message-passing, complete communication graph, initial failures, leader election, matching}
}

Document

DOI: 10.4230/OASIcs.ICPEC.2025.2

Enabling Secure Coding: Exploring GenAI for Developer Training and Education

Authors: Sathwik Amburi, Tiago Espinha Gasiba, Ulrike Lechner, and Maria Pinto-Albuquerque

Published in: OASIcs, Volume 133, 6th International Computer Programming Education Conference (ICPEC 2025)

Abstract

The rapid adoption of GenAI for code generation presents unprecedented opportunities and significant security challenges. Raising awareness about secure coding is critical for preventing software vulnerabilities. To investigate how Generative AI can best support secure coding, we built an AI Secure Coding platform, an interactive training environment that embeds a GPT-4 based chatbot directly into a structured challenge workflow. The platform comprises a landing page, a challenges page with three AI-generated tasks, and a challenge page where participants work with code snippets. In each challenge, developers (1) identify vulnerabilities by reviewing code and adding comments, (2) ask the AI for help via a chat based interface, (3) review and refine comments based on AI feedback, and (4) fix vulnerabilities by submitting secure patches. The study involved 18 industry developers tackling three challenges. Participants used the AI Secure Coding Platform to detect and remediate vulnerabilities and then completed a survey to capture their opinions and comfort level with AI assisted platform for secure coding. Results show that AI assistance can boost productivity, reduce errors, and uncover more defects when treated as a "second pair of eyes," but it can also foster over-reliance. This study introduces the AI Secure Coding platform, presents preliminary results from a initial study, and shows that embedding GenAI into a structured secure-coding workflow can both enable and challenge developers. This work also opens the door to a new research field: leveraging GenAI to enable secure software development.

Cite as

Sathwik Amburi, Tiago Espinha Gasiba, Ulrike Lechner, and Maria Pinto-Albuquerque. Enabling Secure Coding: Exploring GenAI for Developer Training and Education. In 6th International Computer Programming Education Conference (ICPEC 2025). Open Access Series in Informatics (OASIcs), Volume 133, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{amburi_et_al:OASIcs.ICPEC.2025.2,
  author =	{Amburi, Sathwik and Espinha Gasiba, Tiago and Lechner, Ulrike and Pinto-Albuquerque, Maria},
  title =	{{Enabling Secure Coding: Exploring GenAI for Developer Training and Education}},
  booktitle =	{6th International Computer Programming Education Conference (ICPEC 2025)},
  pages =	{2:1--2:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-393-5},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{133},
  editor =	{Queir\'{o}s, Ricardo and Pinto, M\'{a}rio and Portela, Filipe and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2025.2},
  URN =		{urn:nbn:de:0030-drops-240321},
  doi =		{10.4230/OASIcs.ICPEC.2025.2},
  annote =	{Keywords: Secure Coding, Industry, Software Development, Generative AI, Large Language Models, Teaching}
}

Document

DOI: 10.4230/LIPIcs.STACS.2025.45

Forbidden Patterns in Mixed Linear Layouts

Authors: Deborah Haun, Laura Merker, and Sergey Pupyrev

Published in: LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)

Abstract

An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue) number of an ordered graph is the minimum number of required stacks (queues). Mixed linear layouts combine these layouts by allowing each set of edges to form either a stack or a queue. The minimum number of stacks plus queues is called the mixed page number. It is well known that ordered graphs with small stack number are characterized, up to a function, by the absence of large twists (that is, pairwise crossing edges). Similarly, ordered graphs with small queue number are characterized by the absence of large rainbows (that is, pairwise nesting edges). However, no such characterization via forbidden patterns is known for mixed linear layouts. We address this gap by introducing patterns similar to twists and rainbows, which we call thick patterns; such patterns allow a characterization, again up to a function, of mixed linear layouts of bounded-degree graphs. That is, we show that a family of ordered graphs with bounded maximum degree has bounded mixed page number if and only if the size of the largest thick pattern is bounded. In addition, we investigate an exact characterization of ordered graphs whose mixed page number equals a fixed integer k via a finite set of forbidden patterns. We show that for k = 2, there is no such characterization, which supports the nature of our first result.

Cite as

Deborah Haun, Laura Merker, and Sergey Pupyrev. Forbidden Patterns in Mixed Linear Layouts. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 45:1-45:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{haun_et_al:LIPIcs.STACS.2025.45,
  author =	{Haun, Deborah and Merker, Laura and Pupyrev, Sergey},
  title =	{{Forbidden Patterns in Mixed Linear Layouts}},
  booktitle =	{42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)},
  pages =	{45:1--45:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-365-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{327},
  editor =	{Beyersdorff, Olaf and Pilipczuk, Micha{\l} and Pimentel, Elaine and Thắng, Nguy\~{ê}n Kim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.45},
  URN =		{urn:nbn:de:0030-drops-228717},
  doi =		{10.4230/LIPIcs.STACS.2025.45},
  annote =	{Keywords: Ordered Graphs, linear Layout, mixed linear Layout, Stack Layout, Queue Layout}
}

Document

DOI: 10.4230/LITES-v004-i001-a003

Quantitative Analysis of Consistency in NoSQL Key-Value Stores

Authors: Si Liu, Jatin Ganhotra, Muntasir Raihan Rahman, Son Nguyen, Indranil Gupta, and José Meseguer

Published in: LITES, Volume 4, Issue 1 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 1

Abstract

The promise of high scalability and availability has prompted many companies to replace traditional relational database management systems (RDBMS) with NoSQL key-value stores. This comes at the cost of relaxed consistency guarantees: key-value stores only guarantee eventual consistency in principle. In practice, however, many key-value stores seem to offer stronger consistency. Quantifying how well consistency properties are met is a non-trivial problem. We address this problem by formally modeling key-value stores as probabilistic systems and quantitatively analyzing their consistency properties by both statistical model checking and implementation evaluation. We present for the first time a formal probabilistic model of Apache Cassandra, a popular NoSQL key-value store, and quantify how much Cassandra achieves various consistency guarantees under various conditions. To validate our model, we evaluate multiple consistency properties using two methods and compare them against each other. The two methods are: (1) an implementation-based evaluation of the source code; and (2) a statistical model checking analysis of our probabilistic model.

Cite as

Si Liu, Jatin Ganhotra, Muntasir Raihan Rahman, Son Nguyen, Indranil Gupta, and José Meseguer. Quantitative Analysis of Consistency in NoSQL Key-Value Stores. In LITES, Volume 4, Issue 1 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 1, pp. 03:1-03:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@Article{liu_et_al:LITES-v004-i001-a003,
  author =	{Liu, Si and Ganhotra, Jatin and Rahman, Muntasir Raihan and Nguyen, Son and Gupta, Indranil and Meseguer, Jos\'{e}},
  title =	{{Quantitative Analysis of Consistency in NoSQL Key-Value Stores}},
  journal =	{Leibniz Transactions on Embedded Systems},
  pages =	{03:1--03:26},
  ISSN =	{2199-2002},
  year =	{2017},
  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/LITES-v004-i001-a003},
  URN =		{urn:nbn:de:0030-drops-192649},
  doi =		{10.4230/LITES-v004-i001-a003},
  annote =	{Keywords: NoSQL Key-value Store, Consistency, Statistical Model Checking, Rewriting Logic, Maude}
}

Document

DOI: 10.4230/DagRep.4.12.68

Collective Adaptive Systems: Qualitative and Quantitative Modelling and Analysis (Dagstuhl Seminar 14512)

Authors: Jane Hillston, Jeremy Pitt, Martin Wirsing, and Franco Zambonelli

Published in: Dagstuhl Reports, Volume 4, Issue 12 (2015)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 14512 "Collective Adaptive Systems: Qualitative and Quantitative Modelling and Analysis". Besides presentations on current work in the area, the seminar focused on the following topics: (i) Modelling techniques and languages for collective adaptive systems based on the above formalisms. (ii) Verification of collective adaptive systems. (iii) Humans-in-the-loop in collective adaptive systems.

Cite as

Jane Hillston, Jeremy Pitt, Martin Wirsing, and Franco Zambonelli. Collective Adaptive Systems: Qualitative and Quantitative Modelling and Analysis (Dagstuhl Seminar 14512). In Dagstuhl Reports, Volume 4, Issue 12, pp. 68-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{hillston_et_al:DagRep.4.12.68,
  author =	{Hillston, Jane and Pitt, Jeremy and Wirsing, Martin and Zambonelli, Franco},
  title =	{{Collective Adaptive Systems: Qualitative and Quantitative Modelling and Analysis (Dagstuhl Seminar 14512)}},
  pages =	{68--113},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{12},
  editor =	{Hillston, Jane and Pitt, Jeremy and Wirsing, Martin and Zambonelli, Franco},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.12.68},
  URN =		{urn:nbn:de:0030-drops-50066},
  doi =		{10.4230/DagRep.4.12.68},
  annote =	{Keywords: Collective Adaptive Systems, Qualitative and Quantitative Modelling and Analysis, Verification, Humans-In-The-Loop}
}

Document

DOI: 10.4230/DagMan.4.1.1

Massive Open Online Courses: Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)

Authors: Pierre Dillenbourg, Armando Fox, Claude Kirchner, John Mitchell, and Martin Wirsing

Published in: Dagstuhl Manifestos, Volume 4, Issue 1 (2014)

Abstract

The rapid emergence and adoption of Massive Open Online Courses (MOOCs) has raised new questions and rekindled old debates in higher education. Academic leaders are concerned about educational quality, access to content, privacy protection for learner data, production costs and the proper relationship between MOOCs and residential instruction, among other matters. At the same time, these same leaders see opportunities for the scale of MOOCs to support learning: faculty interest in teaching innovation, better learner engagement through personalization, increased understanding of learner behavior through large-scale data analytics, wider access for continuing education learners and other nonresidential learners, and the possibility to enhance revenue or lower educational costs. Two years after "the year of the MOOC", this report summarizes the state of the art and the future directions of greatest interest as seen by an international group of academic leaders. Eight provocative positions are put forward, in hopes of aiding policy-makers, academics, administrators, and learners regarding the potential future of MOOCs in higher education. The recommendations span a variety of topics including financial considerations, pedagogical quality, and the social fabric.

Cite as

Pierre Dillenbourg, Armando Fox, Claude Kirchner, John Mitchell, and Martin Wirsing. Massive Open Online Courses: Current State and Perspectives (Dagstuhl Perspectives Workshop 14112). In Dagstuhl Manifestos, Volume 4, Issue 1, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{dillenbourg_et_al:DagMan.4.1.1,
  author =	{Dillenbourg, Pierre and Fox, Armando and Kirchner, Claude and Mitchell, John and Wirsing, Martin},
  title =	{{Massive Open Online Courses: Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)}},
  pages =	{1--27},
  journal =	{Dagstuhl Manifestos},
  ISSN =	{2193-2433},
  year =	{2014},
  volume =	{4},
  number =	{1},
  editor =	{Dillenbourg, Pierre and Fox, Armando and Kirchner, Claude and Mitchell, John and Wirsing, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagMan.4.1.1},
  URN =		{urn:nbn:de:0030-drops-47861},
  doi =		{10.4230/DagMan.4.1.1},
  annote =	{Keywords: Massive open online course, MOOC, SPOC, e-learning, education}
}

Document

DOI: 10.4230/DagRep.4.3.47

Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)

Authors: Pierre Dillenbourg, Claude Kirchner, John C. Mitchell, and Martin Wirsing

Published in: Dagstuhl Reports, Volume 4, Issue 3 (2014)

Abstract

The Perspectives Workshop on "Massively Open Online Courses, Current State and Perspectives" took place at Schloss Dagstuhl on March 10--13, 2014. Twenty-three leading researchers and practitioners from informatics and pedagogical sciences presented and discussed current experiences and future directions, challenges, and visions for the influence of MOOCs on university teaching and learning. The first day of the workshop consisted of a series of presentations in which each participant presented those topics and developments he or she considered most relevant for the future development of MOOCs. The abstracts of these talks are given in the first part of this report. On the second and third day the participants divided into several working groups according to the main thematic areas that had been identified on the first day. This gives rise to a Manifesto to be published in the Dagstuhl Manifesto series and to identifying main research questions rised by the emergence of MOOCs: they are summarized in the second part of this report.

Cite as

Pierre Dillenbourg, Claude Kirchner, John C. Mitchell, and Martin Wirsing. Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112). In Dagstuhl Reports, Volume 4, Issue 3, pp. 47-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{dillenbourg_et_al:DagRep.4.3.47,
  author =	{Dillenbourg, Pierre and Kirchner, Claude and Mitchell, John C. and Wirsing, Martin},
  title =	{{Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)}},
  pages =	{47--61},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Dillenbourg, Pierre and Kirchner, Claude and Mitchell, John C. and Wirsing, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.47},
  URN =		{urn:nbn:de:0030-drops-45910},
  doi =		{10.4230/DagRep.4.3.47},
  annote =	{Keywords: Massively open online courses, MOOC, SPOC, e-learning, education}
}

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.05081.1

05081 Abstracts Collection – Foundations of Global Computing

Authors: José Luiz Fiadeiro, Ugo Montanari, and Martin Wirsing

Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)

Abstract

From 20.02.05 to 25.02.05, the Dagstuhl Seminar 05081 on ``Foundations of Global Computing'' 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

José Luiz Fiadeiro, Ugo Montanari, and Martin Wirsing. 05081 Abstracts Collection – Foundations of Global Computing. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{fiadeiro_et_al:DagSemProc.05081.1,
  author =	{Fiadeiro, Jos\'{e} Luiz and Montanari, Ugo and Wirsing, Martin},
  title =	{{05081 Abstracts Collection – Foundations of Global Computing}},
  booktitle =	{Foundations of Global Computing},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5081},
  editor =	{Jos\'{e} Luiz Fiadeiro and Ugo Montanari 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.05081.1},
  URN =		{urn:nbn:de:0030-drops-4590},
  doi =		{10.4230/DagSemProc.05081.1},
  annote =	{Keywords: Global Computing}
}

Document

DOI: 10.4230/DagSemProc.05081.2

Architectural Views for CommUnity

Authors: Cristóvão Oliveira and Michel Wermelinger

Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)

Abstract

CommUnity and its categorical foundations provide a formal approach to Software Architecture (SA). Several concepts such as (re) configuration and (higher-order) connector have been given precise definitions in this setting. One of the cornerstones of the approach is the separation between computation, coordination and distribution. In this paper, we take this separation one step further and define explicit architectural views, one for each concern. They will be used to help to detect errors made while building the architecture. Moreover they will be a support to improve the design of the system by focusing on one concern at a time and/or by combining them with each other.

Cite as

Cristóvão Oliveira and Michel Wermelinger. Architectural Views for CommUnity. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{oliveira_et_al:DagSemProc.05081.2,
  author =	{Oliveira, Crist\'{o}v\~{a}o and Wermelinger, Michel},
  title =	{{Architectural Views for CommUnity}},
  booktitle =	{Foundations of Global Computing},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5081},
  editor =	{Jos\'{e} Luiz Fiadeiro and Ugo Montanari 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.05081.2},
  URN =		{urn:nbn:de:0030-drops-2967},
  doi =		{10.4230/DagSemProc.05081.2},
  annote =	{Keywords: Software Architecture, views, computation, coordination, distribution}
}

30 Search Results for "Wirsing, Martin"

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Thanks for your feedback!

Could not send message