Affiliation:
1. University of Michigan, Ann Arbor, MI
2. Microsoft Research, Redmond, WA
Abstract
We propose an extension of the behavioral theory of interactive sequential algorithms to deal with the following situation. A query is issued during a certain step, but the step ends before any reply is received. Later, a reply arrives, and later yet the algorithm makes use of this reply. By a persistent query, we mean a query for which a late reply might be used. Our proposal involves issuing, along with a persistent query, a location where a late reply is to be stored. After presenting our proposal in general terms, we discuss the modifications that it requires in the existing axiomatics of interactive sequential algorithms and in the existing syntax and semantics of abstract state machines. To make that discussion self-contained, we include a summary of this material before the modifications. Fortunately, only rather minor modifications are needed.
Funder
Division of Mathematical Sciences
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. What is the Natural Abstraction Level of an Algorithm?;Logic, Computation and Rigorous Methods;2021
2. Eventual Consistency Formalized;Lecture Notes in Computer Science;2019
3. Distributed ASM - Pitfalls and Solutions;Lecture Notes in Computer Science;2014
4. Relativity and Abstract State Machines;System Analysis and Modeling: Theory and Practice;2013