Interval diagram techniques for symbolic model checking of Petri nets

被引:6
|
作者
Strehl, K [1 ]
Thiele, L [1 ]
机构
[1] Swiss Fed Inst Technol, Comp Engn & Networks Lab, TIK, ETH, CH-8092 Zurich, Switzerland
关键词
D O I
10.1109/DATE.1999.761216
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Symbolic model checking tries to reduce the state explosion problem by implicit construction of the state space. The major limiting factor is the size of the symbolic representation mostly stored in huge binary decision diagrams. A new approach to symbolic model checking of Petri nets and related models of computation is presented, outperforming the conventional one and avoiding some of its drawbacks. Our approach is based on a novel, efficient form of representation for multi-valued functions called internal decision diagram (IDD) and the corresponding image computation technique using interval mapping diagrams(IMDs). IDDs and IMDs are introduced, their properties are described, and the feasibility of the new approach is shown with some experimental results.
引用
收藏
页码:756 / 757
页数:2
相关论文
共 50 条
  • [1] ON SYMBOLIC MODEL CHECKING IN PETRI NETS
    HIRAISHI, K
    NAKANO, M
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1995, E78A (11) : 1479 - 1486
  • [2] Symbolic model checking of process networks using interval diagram techniques
    Strehl, K
    Thiele, L
    [J]. 1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 686 - 692
  • [3] Symbolic model checking of dual transition Petri nets
    Varea, M
    Al-Hashimi, BM
    Cortés, LA
    Eles, P
    Peng, Z
    [J]. CODES 2002: PROCEEDINGS OF THE TENTH INTERNATIONAL SYMPOSIUM ON HARDWARE/SOFTWARE CODESIGN, 2002, : 43 - 48
  • [4] Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking
    Igawa, Nao
    Yokogawa, Tomoyuki
    Amasaki, Sousuke
    Kondo, Masafumi
    Sato, Yoichiro
    Arimoto, Kazutami
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2020, E103D (03): : 702 - 705
  • [5] Symbolic computation tree logic model checking of time Petri nets
    Okawa, Y
    Yoneda, T
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1997, 80 (04): : 11 - 20
  • [6] Model checking Petri nets with MSVL
    Shi, Ya
    Tian, Cong
    Duan, Zhenhua
    Zhou, Mengchu
    [J]. INFORMATION SCIENCES, 2016, 363 : 274 - 291
  • [7] MODEL CHECKING OF PERSISTENT PETRI NETS
    BEST, E
    ESPARZA, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 35 - 52
  • [8] Model Checking Reconfigurable Petri Nets with Maude
    Padberg, Julia
    Schulz, Alexander
    [J]. GRAPH TRANSFORMATION, 2016, 9761 : 54 - 70
  • [9] TCTL Model Checking of Time Petri Nets
    Boucheneb, Hanifa
    Gardey, Guillaume
    Roux, Olivier H.
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2009, 19 (06) : 1509 - 1540
  • [10] Petri nets, traces, and local model checking
    Cheng, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1997, 183 (02) : 229 - 251