摘要
The concept of process grammar, based on the idea of vector grammar, for petri net is presented in this pa-per. The process language of a petri net can be generated by derivation according to its process grammar . The set ofbasic process section sequence represented by the process language of a petri net ∑is the same as that represented bythe process expression of ∑if ∑is bounded or fair. In the case of that∑is unbounded and unfair ,the set of all processof∑ can also be represented by its process language passed through parallel processing.
The concept of process grammar. based on the idea of vector grammar, for petri net is presented in this paper. The process language of a petri net can be generated by derivation according to its process grammar . The set of basic process section sequence represented by the process language of a petri net ∑ is the same as that represented by the process expression of ∑ if ∑ is bounded or fair. In the case of that∑ is unbounded and unfair ,the set of all process of ∑ can also be represented by its process language passed through parallel processing.
出处
《计算机科学》
CSCD
北大核心
2002年第12期31-34,共4页
Computer Science
基金
国家自然科学基金(60173053
69573018)
