<?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">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_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>History-deterministic timed automata</dc:title>
   	<dc:creator>Bose, Sougata</dc:creator>
   	<dc:creator>Henzinger, Thomas A ; https://orcid.org/0000-0002-2985-7724</dc:creator>
   	<dc:creator>Lehtinen, Karoliina</dc:creator>
   	<dc:creator>Schewe, Sven</dc:creator>
   	<dc:creator>Totzke, Patrick</dc:creator>
   	<dc:subject>ddc:000</dc:subject>
   	<dc:description>We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and HD specifications allow for game-based verification without an expensive determinization step. We show that the class of timed ω
-languages recognized by HD timed automata strictly extends that of deterministic ones, and is strictly included in those recognised by fully non-deterministic TA. For non-deterministic timed automata it is known that universality is already undecidable for safety/reachability TA. For history-deterministic TA with arbitrary parity acceptance, we show that timed universality, inclusion, and synthesis all remain decidable and are EXPTIME-complete. For the subclass of TA with safety or reachability acceptance, one can decide (in EXPTIME) whether such an automaton is history-deterministic. If so, it can effectively determinized without introducing new automaton states.</dc:description>
   	<dc:publisher>EPI Sciences</dc:publisher>
   	<dc:date>2024</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:Article</dc:type>
   	<dc:type>Article</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/18530</dc:identifier>
   	<dc:identifier>https://research-explorer.ista.ac.at/download/18530/18532</dc:identifier>
   	<dc:source>Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. History-deterministic timed automata. &lt;i&gt;Logical Methods in Computer Science&lt;/i&gt;. 2024;20(4):1-28. doi:&lt;a href=&quot;https://doi.org/10.46298/lmcs-20(4:1)2024&quot;&gt;10.46298/lmcs-20(4:1)2024&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.46298/lmcs-20(4:1)2024</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1860-5974</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/wos/001332466900002</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2304.03183</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
