并行处理的基于图的算法

Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI:10.1109/HPCSA.2002.1019142

S. Yordanova

{"title":"并行处理的基于图的算法","authors":"S. Yordanova","doi":"10.1109/HPCSA.2002.1019142","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to present some graph-based algorithms for Finite State Process (FSP). Communicating Sequential Process generated by Finite Transition System is called FSP. If P and Q are FSP, the parallel process P/spl par/Q also is FSP. We will present an algorithm to construct parallel process of finite set of FSP and an algorithm to construct finite complete prefix.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph-based algorithms for parallel processes\",\"authors\":\"S. Yordanova\",\"doi\":\"10.1109/HPCSA.2002.1019142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of this paper is to present some graph-based algorithms for Finite State Process (FSP). Communicating Sequential Process generated by Finite Transition System is called FSP. If P and Q are FSP, the parallel process P/spl par/Q also is FSP. We will present an algorithm to construct parallel process of finite set of FSP and an algorithm to construct finite complete prefix.\",\"PeriodicalId\":111862,\"journal\":{\"name\":\"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCSA.2002.1019142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCSA.2002.1019142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文的目的是提出有限状态过程(FSP)的一些基于图的算法。由有限过渡系统产生的通信顺序过程称为FSP。如果P和Q是FSP，则并行进程P/spl par/Q也是FSP。给出了构造FSP有限集并行过程的算法和构造有限完备前缀的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Graph-based algorithms for parallel processes

The aim of this paper is to present some graph-based algorithms for Finite State Process (FSP). Communicating Sequential Process generated by Finite Transition System is called FSP. If P and Q are FSP, the parallel process P/spl par/Q also is FSP. We will present an algorithm to construct parallel process of finite set of FSP and an algorithm to construct finite complete prefix.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications

自引率

0.00%

发文量