节点文献
基于限定步长的消息队列并发程序可达性算法分析
Reachability Algorithm Analysis of Message Queue Concurrent Programs in Bounded Phase
【摘要】 针对消息队列并发程序执行过程中可达性问题上存在的不确定性,将消息队列并发程序转换为多栈下推系统,利用饱和过程,构造一个可以接收逆向格局集合的非确定型有限自动机,并给出相应的求解算法,证明了逆向格局集合的可达性,进而验证了此类并发程序的可达性。
【Abstract】 According to the non-determinacy during the execution of concurrent programs based on message queues, this paper convert concurrent program communicating using message queues to the multi-stack pushdown system, moreover uses the saturation procedure to construct an automaton which can recognize the sets of backward configuration, then the relevant solving algorithm is provided, thus further proves that the backward reachability of configuration sets is decidable. Consequently, the reachability problem for these concurrent queue programs is solved.
【关键词】 可达性;
限定步长;
消息队列;
并发程序;
多栈下推系统;
【Key words】 Reachability; Bounded Phase; Message Queues; Concurrent Programes; Multi-stack Pushdown System;
【Key words】 Reachability; Bounded Phase; Message Queues; Concurrent Programes; Multi-stack Pushdown System;
- 【文献出处】 电脑编程技巧与维护 ,Computer Programming Skills & Maintenance , 编辑部邮箱 ,2014年06期
- 【分类号】TP311.1
- 【下载频次】33