<?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-10-02T04:49:55Z</responseDate>
  <request identifier="1740" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1740</identifier>
        <datestamp>2026-09-29T20:50:17Z</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>Runtime Monitoring of Metric First-order Temporal Properties</dc:title>
          <dc:creator>Basin, David</dc:creator>
          <dc:creator>Klaedtke, Felix</dc:creator>
          <dc:creator>Müller, Samuel</dc:creator>
          <dc:creator>Pfitzmann, Birgit</dc:creator>
          <dc:subject>Runtime Monitoring</dc:subject>
          <dc:subject>Metric First-order Temporal Logic</dc:subject>
          <dc:subject>Automatic Structures</dc:subject>
          <dc:subject>Temporal Databases</dc:subject>
          <dc:description>We introduce a novel approach to the runtime monitoring of complex&#13;
  system properties. In particular, we present an online algorithm for&#13;
  a safety fragment of metric first-order temporal logic that&#13;
  is considerably more expressive than the logics supported by prior&#13;
  monitoring methods. Our approach, based on automatic structures,&#13;
  allows the unrestricted use of negation, universal and existential&#13;
  quantification over infinite domains, and the arbitrary nesting of&#13;
  both past and bounded future operators. Moreover, we show how&#13;
  to optimize our approach for the common case where&#13;
  structures consist of only finite relations, over possibly infinite&#13;
  domains. Under an additional restriction, we prove that the space&#13;
  consumed by our monitor is polynomially bounded by the cardinality&#13;
  of the data appearing in the processed prefix of the temporal&#13;
  structure being monitored.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>David Basin and Felix Klaedtke and Samuel Müller and Birgit Pfitzmann</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 2, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2008)</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.FSTTCS.2008.1740</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-17404</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1740</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
