计算可达模拟(Reachable Simulations)
Computing Reachable Simulations
AI总结:
本研究针对模拟前序可达主体与模拟等价可达块的计算问题,通过理论分析明确其与互模拟情形的差异,提出交错可达性与模拟计算的思路及适配无限状态系统的符号算法以求解该问题。
摘要:
我们研究计算模拟前序的可达主体以及模拟等价的可达块的问题。在对该问题的可判定性与复杂度方面展开理论研究(该研究尤其凸显了其与已解决的互模拟情形的鲜明差异)之后,我们利用将可达性与模拟计算交错进行、同时尽可能避免计算所有可达状态或完整模拟前序的思路,设计出求解该问题的算法。我们特别提出了一种处理状态划分、进而处理划分块之间关系的符号算法,该算法适用于处理无限状态系统。
英文摘要:
We study the problem of computing the reachable principals of simulation preorder and the reachable blocks of simulation equivalence. Following a theoretical investigation of the decidability and complexity aspects of this problem, which in particular highlights a stark contrast with the already settled case of bisimulation, we design algorithms to solve this problem by leveraging the idea of interleaving reachability and simulation computation while possibly avoiding the computation of all the reachable states or the whole simulation preorder. In particular, we put forward a symbolic algorithm processing state partitions and, in turn, relations between their blocks, which is suited for processing infinite state systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。