首页|期刊导航|自动化学报（英文版）|Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra

Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra

Dmitry A.Zaitsev Tatiana R.Shmeleva Jan Friso Groote

自动化学报（英文版）2019，Vol.6Issue(3)：733-742,10.

自动化学报（英文版）2019，Vol.6Issue(3)：733-742,10.DOI:10.1109/JAS.2019.1911486

Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra

Dmitry A.Zaitsev ¹Tatiana R.Shmeleva ²Jan Friso Groote³

作者信息

1. Vistula University, Warsaw 02-787, Poland
2. A.S.Popov Odessa National Academy of Telecommunications, Odessa 65023, Ukraine
3. Eindhoven University of Technology, PO Box 513,5600 MB Eindhoven, The Netherlands
折叠

摘要

关键词

Computing grid/conservativeness/deadlock/hypertorus/infinite Petri nets/process algebra/systems biology

Key words

Computing grid/conservativeness/deadlock/hypertorus/infinite Petri nets/process algebra/systems biology

引用本文复制引用

Dmitry A.Zaitsev,Tatiana R.Shmeleva,Jan Friso Groote..Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra[J].自动化学报（英文版）,2019,6(3):733-742,10.

基金项目

This work was supported in part by NATO (ICS.NUKR.CLG982689). （ICS.NUKR.CLG982689）

自动化学报（英文版）

OACSCDCSTPCDEI

ISSN：2329-9266

访问量0

下载量0

段落导航