On Liveness Enforcement of DSSP net systems

被引:0
|
作者
Clavel, Daniel [1 ]
Mahulea, Cristian [1 ]
Silva, Manuel [1 ]
机构
[1] Univ Zaragoza, Aragon Inst Engn Res I3A, Zaragoza, Spain
来源
2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC) | 2016年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deterministically Synchronized Sequential Process (DSSP) are modular Petri Net (PN) systems composed by a set of state machines PNs (called also agents) cooperating in a distributed way through asynchronous message passing. Messages can delay the normal execution of agents, but to not addition the resolution of conflicts. The modular structure of DSSP allows strong analytical results, (for example, the rank theorem provides necessary and sufficient condition for structural liveness). This paper considers a synthesis problem of liveness enforcing. For some particular structures of DSSP in which the rank theorem does not hold we provide a technique based on the pre-assignment of the buffers in order to ensure that the model becomes live.
引用
收藏
页码:3935 / 3941
页数:7
相关论文
共 50 条