基于图的操作还原模型的合成过程树重建

N. Efanov
{"title":"基于图的操作还原模型的合成过程树重建","authors":"N. Efanov","doi":"10.1109/EnT50437.2020.9431277","DOIUrl":null,"url":null,"abstract":"This paper provides the results of experiments on process trees reconstruction using graph rewriting-based method, that is theoretically proved to reconstruct in polynomial time any configuration of process tree with different process' identifiers, sessions, process groups, reverse reparents and attributes with the same semantics of process tree changing. The datasets for experiments were generated synthetically, according to standard process' configurations in cases of terminal job control and daemon activity. Graph rewriting-based method results is compared with profiling results both on time-costs and reconstruction results. The corresponding experimental software package is also discussed in the paper.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Synthetic Process Trees Reconstruction Using Graph-Based Operation Restore Model\",\"authors\":\"N. Efanov\",\"doi\":\"10.1109/EnT50437.2020.9431277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper provides the results of experiments on process trees reconstruction using graph rewriting-based method, that is theoretically proved to reconstruct in polynomial time any configuration of process tree with different process' identifiers, sessions, process groups, reverse reparents and attributes with the same semantics of process tree changing. The datasets for experiments were generated synthetically, according to standard process' configurations in cases of terminal job control and daemon activity. Graph rewriting-based method results is compared with profiling results both on time-costs and reconstruction results. The corresponding experimental software package is also discussed in the paper.\",\"PeriodicalId\":129694,\"journal\":{\"name\":\"2020 International Conference Engineering and Telecommunication (En&T)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference Engineering and Telecommunication (En&T)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EnT50437.2020.9431277\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference Engineering and Telecommunication (En&T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EnT50437.2020.9431277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文给出了用基于图重写的方法重构过程树的实验结果,从理论上证明了在多项式时间内重构具有不同进程标识符、会话、进程组、反向修饰和具有相同进程树变化语义的进程树的任何构形。在终端作业控制和守护进程活动的情况下,根据标准进程配置,综合生成实验数据集。从时间成本和重构结果两方面对基于图形重写的方法结果与轮廓分析结果进行了比较。本文还讨论了相应的实验软件包。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Synthetic Process Trees Reconstruction Using Graph-Based Operation Restore Model
This paper provides the results of experiments on process trees reconstruction using graph rewriting-based method, that is theoretically proved to reconstruct in polynomial time any configuration of process tree with different process' identifiers, sessions, process groups, reverse reparents and attributes with the same semantics of process tree changing. The datasets for experiments were generated synthetically, according to standard process' configurations in cases of terminal job control and daemon activity. Graph rewriting-based method results is compared with profiling results both on time-costs and reconstruction results. The corresponding experimental software package is also discussed in the paper.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信