配价系统的有界上下文切换
Bounded Context Switching for Valence Systems
摘要:
我们研究价系统,有限控制程序的无限状态记忆建模的图monoid。我们的贡献是有界上下文切换(BCS)的概念。配价系统推广了下推、并发下推和Petri网。在这些情况下,我们的定义保守地概括了现有的概念。主要发现是,有界数量的上下文切换内的可达性是NP中的,独立于内存(图么半群)。我们的证明是真正的代数,因此有助于一种新的方式来思考BCS。此外,我们展示了一类BCS可达性属于P的存储机制。
英文摘要:
We study valence systems, finite-control programs over infinite-state memories modeled in terms of graph monoids. Our contribution is a notion of bounded context switching (BCS). Valence systems generalize pushdowns, concurrent pushdowns, and Petri nets. In these settings, our definition conservatively generalizes existing notions. The main finding is that reachability within a bounded number of context switches is in NP, independent of the memory (the graph monoid). Our proof is genuinely algebraic, and therefore contributes a new way to think about BCS. In addition, we exhibit a class of storage mechanisms for which BCS reachability belongs to P.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。