<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:08:28Z</responseDate>
  <request identifier="12972" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:12972</identifier>
        <datestamp>2024-03-06T10:51:28Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Negotiating Temporal Commitments in Cross-Organizational Business Processes</dc:title>
          <dc:creator>Franceschetti, Marco</dc:creator>
          <dc:creator>Eder, Johann</dc:creator>
          <dc:subject>Cross-organizational processes</dc:subject>
          <dc:subject>Temporal parameters</dc:subject>
          <dc:subject>Range negotiation</dc:subject>
          <dc:description>Cross-organizational business processes emerge from the cooperation of intra-organizational business processes through exchange of messages. The involved parties agree on communication protocols, which contain in particular temporal constraints: as obligations on one hand, and as guarantees on the other hand. These constraints form also requirements for the design of the hidden implementation of the processes and are the basis for control decisions for each party. We present a comprehensive methodology for modeling the temporal aspects of cross-organizational business processes, checking dynamic controllability of such processes, and supporting the negotiation of temporal commitments. We do so by computing the consequences of temporal constraints in choreographies, and by computing the weakest preconditions for the dynamic controllability of a participating process.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Marco Franceschetti and Johann Eder</dc:contributor>
          <dc:date>2020</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.TIME.2020.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-129729</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
