Deterministic Languages of Petri Nets
Deterministic Languages of Petri Nets
复制标题
Petri 网的确定性语言
DOI：
--
复制
发表时间：
1980
期刊：
影响因子：
--
通讯作者：
G. Vidal
中科院分区：
文献类型：
--
作者：
G. Vidal
使用 Petri 网进行系统建模的一种方法是通过标记来表示状态，以及通过转换来修改状态的操作。为了表示一个事件可能导致系统发生不同修改的事实，必须对转换进行标记。例如，在学校中，课程的开始和结束通过铃声来表示或标记。研究系统功能的一种可能方法是检查与对系统进行建模的 Petri 网的转换触发序列相对应的标签序列。已经定义和研究了几类语言：当一个事件或信号导致一个动作时触发转换序列的语言，以及当一个事件可以引起多个动作时标记转换触发序列的单词语言。
One way of using Petri nets for modelling systems is to represent states by markings, and actions that modify the states by transitions. In order to represent the fact that one event can cause different modifications of the system, one has to label the transitions. For example, in a school, the beginning and the end of classes are signalled, or labelled, by the ringing of a bell. One possible way of investigating the functioning of a system is to examine the sequences of labels corresponding to the firing sequences of transitions of the Petri net that models the system. Several classes of languages have been defined and studied: languages of sequences of firing of transitions when one event or signal causes one action, and languages of words labelling firing sequences of transitions when one event can cause several actions.