A symbolic algorithm for the synthesis of bounded Petri nets

被引：0
|
作者：
Carmona, J. [1 ]
Cortadella, J. [1 ]
Kishinevsky, M. [2 ]
Kondratyev, A. [3 ]
Lavagno, L. [4 ]
Yakovlev, A. [5 ]
机构：
[1] Univ Politecn Cataluna, E-08028 Barcelona, Spain
[2] Intel Corp, Santa Clara, CA 95051 USA
[3] Cadence Berkeley Lab, Berkeley, CA 94704 USA
[4] Politecnico Torino, Turin, Italy
[5] Univ Newcastle, Callaghan, NSW 2308, Australia
来源：
APPLICATIONS AND THEORY OF PETRI NETS | 2008年 / 5062卷
基金：
英国工程与自然科学研究理事会;
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events are split into several transitions to guarantee the synthesis of a Petri net with bisimilar behavior. The algorithm uses symbolic representations of multisets of states to efficiently generate all the minimal regions. The algorithm has been implemented in a tool. Experimental results show a significant net reduction when compared with approaches for the synthesis of safe Petri nets.
引用
收藏
页码：92 / +
页数：2
相关论文
共 50 条
  • [1] Symbolic analysis of bounded Petri nets
    Pastor, E
    Cortadella, J
    Roig, O
    IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (05) : 432 - 448
  • [2] Symbolic state estimation in bounded timed labeled Petri nets
    Dong, Yifan
    Wu, Naiqi
    Li, Zhiwu
    AUTOMATICA, 2024, 160
  • [3] Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking
    Igawa, Nao
    Yokogawa, Tomoyuki
    Amasaki, Sousuke
    Kondo, Masafumi
    Sato, Yoichiro
    Arimoto, Kazutami
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2020, E103D (03) : 702 - 705
  • [4] The Complexity of Synthesis of b-Bounded Petri Nets
    Tredup, Ronny
    FUNDAMENTA INFORMATICAE, 2021, 183 (1-2) : 125 - 167
  • [5] A semi-symbolic diagnoser for fault diagnosis of bounded labeled petri nets
    Boussif, Abderraouf
    Ghazel, Mohamed
    Klai, Kais
    ASIAN JOURNAL OF CONTROL, 2021, 23 (02) : 648 - 660
  • [6] Symbolic vs. Bounded Synthesis for Petri Games
    Finkbeiner, Bernd
    Gieseking, Manuel
    Hecking-Harbusch, Jesko
    Olderog, Ernst-Ruediger
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (260): : 23 - 43
  • [7] Symbolic computation of Petri nets
    Iglesias, Andres
    Kapcak, Sinan
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 2, PROCEEDINGS, 2007, 4488 : 235 - +
  • [8] Diagnosability of bounded Petri nets
    Cabasino, Maria Paola
    Giua, Alessandro
    Seatzu, Carla
    PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 1254 - 1260
  • [9] COMPOSITIONAL SYNTHESIS OF LIVE AND BOUNDED FREE CHOICE PETRI NETS
    ESPARZA, J
    SILVA, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 527 : 172 - 187
  • [10] Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets
    Lime, Didier
    Roux, Olivier H.
    Seidner, Charlotte
    APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2019, 2019, 11522 : 406 - 425
12345