Symbolic reachability graph and partial symmetries

被引：0
|
作者：
Haddad, S
Ilie, JM
Taghelit, M
Zouari, B
机构：
[1] UNIV PARIS 06, MASI, CNRS URA 818, F-75252 PARIS, FRANCE
[2] FAC SCI TUNIS, TUNIS 1060, TUNISIA
来源：
APPLICATION AND THEORY OF PETRI NETS 1995 | 1995年 / 935卷
关键词：
analysis and synthesis; structure and behavior of nets; well-formed Petri nets; symbolic reachability graphs; partial symmetries;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The construction of symbolic reachability graphs is a useful technique for reducing state explosion in High-level Petri nets. Such a reduction is obtained by exploiting the symmetries of the whole net [1]. In this paper, we extend this method to deal with partial symmetries. In a first time, we introduce an example which shows the interest and the principles of our method. Then we develop the general algorithm. Lastly we enumerate the properties of this Extended Symbolic Reachability Graph, including the reachability equivalence.
引用
收藏
页码：238 / 257
页数：20
相关论文
共 50 条
  • [21] Symbolic Optimal Reachability in Weighted Timed Automata
    Bouyer, Patricia
    Colange, Maximilien
    Markey, Nicolas
    COMPUTER AIDED VERIFICATION, (CAV 2016), PT I, 2016, 9779 : 513 - 530
  • [22] Distributed Binary Decision Diagrams for Symbolic Reachability
    Oortwijn, Wytse
    van Dijk, Tom
    van de Pol, Jaco
    SPIN'17: PROCEEDINGS OF THE 24TH ACM SIGSOFT INTERNATIONAL SPIN SYMPOSIUM ON MODEL CHECKING OF SOFTWARE, 2017, : 21 - 30
  • [23] Symbolic reachability analysis of multirate hybrid systems
    Zhang, Haibin
    Duan, Zhenhua
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2007, 41 (04): : 412 - 415
  • [24] Symbolic Reachability Computation of A Class of Nonlinear Systems
    Xu, Ming
    Chen, Liangyu
    Li, Zhi-bin
    PROCEEDINGS OF THE 8TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, 2009, : 706 - 710
  • [25] Approximate symbolic reachability of networks of transition systems
    Juvekar, Sudeep
    Thly, Ankur
    Kanade, Varun
    Chakraborty, Supratik
    NEXT GENERATION DESIGN AND VERIFICATION METHODOLOGIES FOR DISTRIBUTED EMBEDDED CONTROL SYSTEMS, 2007, : 117 - +
  • [26] Synthesis of controllers using symbolic reachability graphs
    Abid, Chiheb Ameur
    Zouari, Belhassen
    WODES' 08: PROCEEDINGS OF THE 9TH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, 2008, : 314 - 321
  • [27] Quantum logic synthesis by symbolic reachability analysis
    Hung, WNNH
    Song, WY
    Yang, GW
    Perkowski, M
    41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004, 2004, : 838 - 841
  • [28] Graph polynomials and symmetries
    Chbili, Nafaa
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2019, 18 (09)
  • [29] Observability and reachability of grid graphs via reduction and symmetries
    Notarstefano, Giuseppe
    Parlangeli, Gianfranco
    2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 5923 - 5928
  • [30] Reachability preserving compression for dynamic graph
    Liang, Yuzhi
    Chen, Chen
    Wang, Yukun
    Lei, Kai
    Yang, Min
    Lyu, Ziyu
    INFORMATION SCIENCES, 2020, 520 : 232 - 249
12345