<?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-21T12:57:58Z</responseDate>
  <request identifier="2309" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2309</identifier>
        <datestamp>2024-03-06T10:33:16Z</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>On Timed Alternating Simulation for Concurrent Timed Games</dc:title>
          <dc:creator>Bozzelli, Laura</dc:creator>
          <dc:creator>Legay, Axel</dc:creator>
          <dc:creator>Pinchinat, Sophie</dc:creator>
          <dc:subject>Concurrent Timed Games</dc:subject>
          <dc:subject>Timed Alternating Simulation</dc:subject>
          <dc:subject>Timed Alternating Temporal Logics</dc:subject>
          <dc:description>We address the problem of   alternating simulation refinement  for  concurrent timed games (\TG). We show that checking timed alternating simulation between\TG is \EXPTIME-complete, and provide a logical characterization of thispreorder in terms of a meaningful fragment of a new logic, \TAMTLSTAR.\TAMTLSTAR is an action-based timed extension of standard alternating-timetemporal logic \ATLSTAR, which allows  to quantify on strategies where thedesignated player is not responsible for blocking time.  While for full&#13;
\TAMTLSTAR, model-checking \TG  is undecidable, we show that for its fragment&#13;
\TAMTL, corresponding to the timed version of \ATL, in \EXPTIME.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Laura Bozzelli and Axel Legay and Sophie Pinchinat</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)</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.2009.2309</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-23092</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2309</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>
