Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete

M. Majster-Cederbaum, Nils Semmelrock
{"title":"Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete","authors":"M. Majster-Cederbaum, Nils Semmelrock","doi":"10.4204/EPTCS.138.1","DOIUrl":null,"url":null,"abstract":"The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we consider consist of cooperating systems the communication structure of which forms a line respectively a star.","PeriodicalId":360852,"journal":{"name":"Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.138.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we consider consist of cooperating systems the communication structure of which forms a line respectively a star.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有体系结构约束的协作系统中的可达性是pspace完备的
协作系统中的可达性问题已知是pspace完备的。我们在这里表明,当我们以各种方式限制子系统之间的通信结构时,这个问题仍然是pspace完备的。为此,我们介绍了在实践中经常出现的两个基本的、不可比较的合作系统子类,并提供了各自的约简。我们所考虑的子类由通信结构呈直线或星形的协作系统组成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Backwards State-space Reduction for Planning in Dynamic Knowledge Bases Entity-Linking via Graph-Distance Minimization Specifying and Executing Optimizations for Parallel Programs Graph Transformation Planning via Abstraction Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1