State space axioms for T-systems

State space axioms for T-systems
复制标题

DOI:
10.1007/s00236-015-0219-0
复制
发表时间:
2015-04-01
期刊:
影响因子:
0.6
通讯作者:
Devillers, Raymond
Devillers, Raymond
中科院分区:
计算机科学4区
文献类型:
--
作者:
Best, Eike;Devillers, Raymond

文献摘要

被引文献

相似文献

T-系统是带标记图的Petri网的推广。本文描述了一种综合算法,它允许从满足一组必要性质的有限或无限标号转移系统导出有界或无界T-系统。因此,这些性质可以解释为表征T-系统状态空间的公理。
T-systems are generalisations of marked graph Petri nets. This paper describes synthesis algorithms that allow bounded or unbounded T-systems to be derived from finite or infinite labelled transition systems satisfying a set of necessary properties. These properties can thus be interpreted as axioms characterising T-system state spaces.