<?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-08-18T16:42:45Z</responseDate>
  <request identifier="9577" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:9577</identifier>
        <datestamp>2024-03-06T10:44:46Z</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>Logics Meet 1-Clock Alternating Timed Automata</dc:title>
          <dc:creator>Krishna, Shankara Narayanan</dc:creator>
          <dc:creator>Madnani, Khushraj</dc:creator>
          <dc:creator>Pandya, Paritosh K.</dc:creator>
          <dc:subject>Metric Temporal Logic</dc:subject>
          <dc:subject>Alternating Timed Automata</dc:subject>
          <dc:subject>MSO</dc:subject>
          <dc:subject>Regular Expressions</dc:subject>
          <dc:subject>Expressive Completeness</dc:subject>
          <dc:description>This paper investigates a decidable and highly expressive real time logic QkMSO which is obtained by extending MSO[&lt;] with guarded quantification using block of less than k metric quantifiers. The resulting logic is shown to be expressively equivalent to 1-clock ATA where loops are without clock resets, as well as, RatMTL, a powerful extension of MTL[U_I] with regular expressions. We also establish 4-variable property for QkMSO and characterize the expressive power of its 2-variable fragment. Thus, the paper presents progress towards expressively complete logics for 1-clock ATA.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Shankara Narayanan Krishna and Khushraj Madnani and Paritosh K. Pandya</dc:contributor>
          <dc:date>2018</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)</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.2018.39</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-95779</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.39</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>
