<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>A really temporal logic</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Rajeev</namePart>
  <namePart type="family">Alur</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Thomas A</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40876CD8-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000−0002−2985−7724</description></name>









<name type="conference">
  <namePart>FOCS: Foundations of Computer Science</namePart>
</name>






<abstract lang="eng">A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.</abstract>

<originInfo><publisher>IEEE</publisher><dateIssued encoding="w3cdtf">1989</dateIssued><place><placeTerm type="text">Research Triangle Park, NC, USA</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>30th Annual Symposium on Foundations of Computer Science</title></titleInfo>
  <identifier type="issn">0018-9162</identifier>
  <identifier type="eIssn">1558-0814</identifier>
  <identifier type="isbn">0-8186-1982-1</identifier><identifier type="doi">10.1109/SFCS.1989.63473</identifier>
<part><extent unit="pages">164 - 169</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<chicago>Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In &lt;i&gt;30th Annual Symposium on Foundations of Computer Science&lt;/i&gt;, 164–69. FCOS. IEEE, 1989. &lt;a href=&quot;https://doi.org/10.1109/SFCS.1989.63473&quot;&gt;https://doi.org/10.1109/SFCS.1989.63473&lt;/a&gt;.</chicago>
<short>R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.</short>
<ista>Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.</ista>
<mla>Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” &lt;i&gt;30th Annual Symposium on Foundations of Computer Science&lt;/i&gt;, IEEE, 1989, pp. 164–69, doi:&lt;a href=&quot;https://doi.org/10.1109/SFCS.1989.63473&quot;&gt;10.1109/SFCS.1989.63473&lt;/a&gt;.</mla>
<ama>Alur R, Henzinger TA. A really temporal logic. In: &lt;i&gt;30th Annual Symposium on Foundations of Computer Science&lt;/i&gt;. FCOS. IEEE; 1989:164-169. doi:&lt;a href=&quot;https://doi.org/10.1109/SFCS.1989.63473&quot;&gt;10.1109/SFCS.1989.63473&lt;/a&gt;</ama>
<ieee>R. Alur and T. A. Henzinger, “A really temporal logic,” in &lt;i&gt;30th Annual Symposium on Foundations of Computer Science&lt;/i&gt;, Research Triangle Park, NC, USA, 1989, pp. 164–169.</ieee>
<apa>Alur, R., &amp;#38; Henzinger, T. A. (1989). A really temporal logic. In &lt;i&gt;30th Annual Symposium on Foundations of Computer Science&lt;/i&gt; (pp. 164–169). Research Triangle Park, NC, USA: IEEE. &lt;a href=&quot;https://doi.org/10.1109/SFCS.1989.63473&quot;&gt;https://doi.org/10.1109/SFCS.1989.63473&lt;/a&gt;</apa>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>4596</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:09:40Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-02-09T10:40:13Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
