<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Continuous Reactability of Persistent Computing Systems</title>
    <link>http://popups.lib.uliege.be/1373-5411/index.php?id=2899</link>
    <description>Persistent computing systems are an infrastructure of computing anticipatory systems. The reactability of a persistent computing system, which is how many reactions of the system are active at a certain time, is the most important property to characterize the system. On the other hand, to be anticipatory, the reactability of a computing anticipatory system must be continuous. This paper proposes the first method to measure the continuous reactability of a persistent computing system in a unified way. The continuous reactability of a persistent computing system is a new concept of computing systems, so that it will be raise new research problems of computing anticipatory systems as well as persistent computing systems. </description>
    <category domain="http://popups.lib.uliege.be/1373-5411/index.php?id=65">Full text issues</category>
    <category domain="http://popups.lib.uliege.be/1373-5411/index.php?id=93">Volume 20</category>
    <category domain="http://popups.lib.uliege.be/1373-5411/index.php?id=2525">Programming and Automata</category>
    <language>fr</language>
    <pubDate>Tue, 03 Sep 2024 15:45:27 +0200</pubDate>
    <lastBuildDate>Tue, 03 Sep 2024 15:45:36 +0200</lastBuildDate>
    <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=2899</guid>
    <ttl>0</ttl>
  </channel>
</rss>