首页> 外文会议>International symposium on mathematical foundations of computer science >Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
【24h】

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge

机译:知识有限的分布式合成的无限可判定性

获取原文

摘要

We study the problem of controller synthesis for distributed systems modelled by Zielonka automata. While the decidability of this problem in full generality remains open and challenging, we suggest here to seek controllers from a parametrised family: we are interested in controllers that ensure frequent communication between the processes, where frequency is determined by the parameter. We show that this restricted controller synthesis version is affordable for synthesis standards: fixing the parameter, the problem is ExPTIME-complete.
机译:我们研究了由Zielonka自动机建模的分布式系统的控制器综合问题。尽管这个问题的普遍性仍然是开放的,并且具有挑战性,但我们建议在此从参数化的家族中寻求控制器:我们对确保过程之间频繁通信的控制器感兴趣,而这些过程的频率由参数决定。我们证明了这种受限的控制器综合版本对于综合标准而言是可以承受的:固定参数,问题是ExPTIME-complete。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号