<?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>The theory of hybrid automata</title></titleInfo>


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


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

<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>LICS: Logic in Computer Science</namePart>
</name>






<abstract lang="eng">We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces</abstract>

<originInfo><publisher>IEEE</publisher><dateIssued encoding="w3cdtf">1996</dateIssued><place><placeTerm type="text">New Brunswick, NJ, United States of America</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</title></titleInfo>
  <identifier type="issn">1043-6871</identifier><identifier type="doi">10.1109/LICS.1996.561342 </identifier>
<part><extent unit="pages">278 - 292</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<apa>Henzinger, T. A. (1996). The theory of hybrid automata. In &lt;i&gt;Proceedings 11th Annual IEEE Symposium on Logic in Computer Science&lt;/i&gt; (pp. 278–292). New Brunswick, NJ, United States of America: IEEE. &lt;a href=&quot;https://doi.org/10.1109/LICS.1996.561342 &quot;&gt;https://doi.org/10.1109/LICS.1996.561342 &lt;/a&gt;</apa>
<ista>Henzinger TA. 1996. The theory of hybrid automata. Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 278–292.</ista>
<chicago>Henzinger, Thomas A. “The Theory of Hybrid Automata.” In &lt;i&gt;Proceedings 11th Annual IEEE Symposium on Logic in Computer Science&lt;/i&gt;, 278–92. IEEE, 1996. &lt;a href=&quot;https://doi.org/10.1109/LICS.1996.561342 &quot;&gt;https://doi.org/10.1109/LICS.1996.561342 &lt;/a&gt;.</chicago>
<ieee>T. A. Henzinger, “The theory of hybrid automata,” in &lt;i&gt;Proceedings 11th Annual IEEE Symposium on Logic in Computer Science&lt;/i&gt;, New Brunswick, NJ, United States of America, 1996, pp. 278–292.</ieee>
<ama>Henzinger TA. The theory of hybrid automata. In: &lt;i&gt;Proceedings 11th Annual IEEE Symposium on Logic in Computer Science&lt;/i&gt;. IEEE; 1996:278-292. doi:&lt;a href=&quot;https://doi.org/10.1109/LICS.1996.561342 &quot;&gt;10.1109/LICS.1996.561342 &lt;/a&gt;</ama>
<short>T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 278–292.</short>
<mla>Henzinger, Thomas A. “The Theory of Hybrid Automata.” &lt;i&gt;Proceedings 11th Annual IEEE Symposium on Logic in Computer Science&lt;/i&gt;, IEEE, 1996, pp. 278–92, doi:&lt;a href=&quot;https://doi.org/10.1109/LICS.1996.561342 &quot;&gt;10.1109/LICS.1996.561342 &lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>4519</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:09:16Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-07-06T07:56:28Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
