arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0811.0819cs.PLcs.LO
收藏

持久性的

Persistent Queries

Andreas Blass, Yuri Gurevich

摘要:

我们提出了一个语法和语义的交互式抽象状态机来处理以下情况。在某个步骤期间发出查询,但该步骤在收到任何答复之前结束。稍后,一个回复到达,然后算法使用这个回复。持久查询是指可能使用延迟回复的查询。从语法上讲,我们的建议包括发出一个持久查询,以及一个存储延迟回复的位置。在语义上,它只涉及对现有的交互式小步抽象状态机理论的微小修改。

英文摘要:

We propose a syntax and semantics for interactive abstract state machines 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. Syntactically, our proposal involves issuing, along with a persistent query, a location where a late reply is to be stored. Semantically, it involves only a minor modification of the existing theory of interactive small-step abstract state machines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑