一种基于模糊Petri网的词计算模型
A Fuzzy Petri Nets Model for Computing With Words
摘要：
受Zadeh用词而不是数字计算的范式的启发，最近提出了几种用词计算的正式模型。这些模型是基于自动机，因此不太适合并发计算。本文将并发计算模型Petri网与模糊集理论相结合，建立了一个词计算的并发模型--模糊词计算Petri网（FPNCW）。这种模糊Petri网的新特点是变迁的标号是由模糊集建模的特殊词。通过采用模糊推理的方法，我们给出了一个忠实的扩展FPNCW，这使得有可能计算更多的话。比较了两种形式化的词计算模型--模糊词计算自动机和FPNCW的语言表达能力。最后给出了几个小例子来说明理论的发展。
英文摘要：
Motivated by Zadeh's paradigm of computing with words rather than numbers, several formal models of computing with words have recently been proposed. These models are based on automata and thus are not well-suited for concurrent computing. In this paper, we incorporate the well-known model of concurrent computing, Petri nets, together with fuzzy set theory and thereby establish a concurrency model of computing with words--fuzzy Petri nets for computing with words (FPNCWs). The new feature of such fuzzy Petri nets is that the labels of transitions are some special words modeled by fuzzy sets. By employing the methodology of fuzzy reasoning, we give a faithful extension of an FPNCW which makes it possible for computing with more words. The language expressiveness of the two formal models of computing with words, fuzzy automata for computing with words and FPNCWs, is compared as well. A few small examples are provided to illustrate the theoretical development.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
