基于正则约束的模型检验锁共享系统
Model-checking lock-sharing systems against regular constraints
摘要:
我们研究分布式系统的进程是有限自动机访问一个共享的锁池的验证。我们考虑的目标是本地定期约束的布尔组合。我们表明,这个问题,PSPACE-完全的一般,落在NP与正确的假设系统。我们对一个进程可以访问的锁的数量和释放锁的顺序进行了限制。我们提供了严格的复杂性界限,以及一个可以在PTIME中解决的感兴趣的子案例。
英文摘要:
We study the verification of distributed systems where processes are finite automata with access to a shared pool of locks. We consider objectives that are boolean combinations of local regular constraints. We show that the problem, PSPACE-complete in general, falls in NP with the right assumptions on the system. We use restrictions on the number of locks a process can access and the order in which locks can be released. We provide tight complexity bounds, as well as a subcase of interest that can be solved in PTIME.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。