arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.0043cs.LOcs.DC
收藏

对称和非对称异步交互

Symmetric and Asymmetric Asynchronous Interaction

Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke

摘要:

我们调查类系统的基础上不同的互动模式,以实现可分配性的目的。作为我们的系统模型,我们使用Petri网。在Petri网中,内置的是一个固有的概念,因为当一个转换有多个前置时,它可能是至关重要的令牌被立即删除。当一个系统的建模是打算以分布式的方式实现的Petri网,这种内置的同步交互的概念可能是有问题的。为了研究这一点,我们考虑网络的异步实现,其中从地方删除令牌不再被认为是瞬时的。我们通过在转换和它们的一些前置项之间插入无声(不可观察)转换来对此进行建模。我们调查了三个这样的实现,不同的是选择的前置过渡从令牌的删除被认为是耗时的,并收集令牌在给定的顺序的可能性。我们调查的效果,这些不同的瞬时相互作用转化为异步的相互作用模式,通过比较网络的行为之前和之后插入的沉默的过渡。我们展示的Petri网类,我们获得等价的行为,就失败等价。事实证明,由此产生的层次结构的Petri网类可以描述的半结构性。对于两个类,我们得到精确的特征;对于剩下的类,我们得到上下界。我们简要地评论我们的结果可能的应用程序的消息序列图。

英文摘要:

We investigate classes of systems based on different interaction patterns with the aim of achieving distributability. As our system model we use Petri nets. In Petri nets, an inherent concept of simultaneity is built in, since when a transition has more than one preplace, it can be crucial that tokens are removed instantaneously. When modelling a system which is intended to be implemented in a distributed way by a Petri net, this built-in concept of synchronous interaction may be problematic. To investigate this we consider asynchronous implementations of nets, in which removing tokens from places can no longer be considered as instantaneous. We model this by inserting silent (unobservable) transitions between transitions and some of their preplaces. We investigate three such implementations, differing in the selection of preplaces of a transition from which the removal of a token is considered time consuming, and the possibility of collecting the tokens in a given order. We investigate the effect of these different transformations of instantaneous interaction into asynchronous interaction patterns by comparing the behaviours of nets before and after insertion of the silent transitions. We exhibit for which classes of Petri nets we obtain equivalent behaviour with respect to failures equivalence. It turns out that the resulting hierarchy of Petri net classes can be described by semi-structural properties. For two of the classes we obtain precise characterisations; for the remaining class we obtain lower and upper bounds. We briefly comment on possible applications of our results to Message Sequence Charts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑