<?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-23T06:31:08Z</responseDate>
  <request identifier="12832" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:12832</identifier>
        <datestamp>2024-03-06T10:50:48Z</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>Partially Observable Concurrent Kleene Algebra</dc:title>
          <dc:creator>Wagemaker, Jana</dc:creator>
          <dc:creator>Brunet, Paul</dc:creator>
          <dc:creator>Docherty, Simon</dc:creator>
          <dc:creator>Kappé, Tobias</dc:creator>
          <dc:creator>Rot, Jurriaan</dc:creator>
          <dc:creator>Silva, Alexandra</dc:creator>
          <dc:subject>Concurrent Kleene algebra</dc:subject>
          <dc:subject>Kleene algebra with tests</dc:subject>
          <dc:subject>observations</dc:subject>
          <dc:subject>axiomatisation</dc:subject>
          <dc:subject>completeness</dc:subject>
          <dc:subject>sequential consistency</dc:subject>
          <dc:description>We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with variables as well as control structures, such as conditionals and loops, that depend on those variables. We illustrate the use of POCKA through concrete examples. We prove that POCKA is a sound and complete axiomatisation of a model of partial observations, and show the semantics passes an important check for sequential consistency.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jana Wagemaker and Paul Brunet and Simon Docherty and Tobias Kappé and Jurriaan Rot and Alexandra Silva</dc:contributor>
          <dc:date>2020</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 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.CONCUR.2020.20</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-128324</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.20</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>
