首页> 外文期刊>IEICE Transactions on Information and Systems >A Partial Order Semantics for FIFO-Nets
【24h】

A Partial Order Semantics for FIFO-Nets

机译:FIFO网络的部分订单语义

获取原文
获取原文并翻译 | 示例
       

摘要

In this work, we give a true concurrency seman- tics for FIFO-nets, that are Petri nets in which places behave as queues, tokens take values in a finite alphabet and the firing of a transition depends on sequences on the alphabet. We introduce fn-processes to represent the concurrent behavior of a FIFO-net N during a sequence of transition firings. Fn-processes are mod- eled by a mapping from a simple FIFO-net without queue sharing and cycles, named FIFO-occurrence net, to N. Moreover, the re- lation among the firings expressed by the FIFO-occurrence net has been enriched by an ordering relation among the elements of the FIFO-occurrence net representing values entered into a same queue of N.
机译:在这项工作中,我们为FIFO网络提供了一种真正的并发语义,即Petri网,其中的地方表现为队列,令牌以有限的字母形式取值,并且转换的触发取决于字母表上的序列。我们引入fn进程来表示一系列过渡触发期间FIFO-net N的并发行为。 Fn进程通过从没有队列共享和周期的简单FIFO网络(称为FIFO发生网络)到N的映射来映射。此外,由FIFO发生网络表示的触发之间的关系得到了丰富。通过代表出现在相同队列N中的值的FIFO出现网络的元素之间的排序关系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号