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 条
  • [41] Symbolic Reachability Analysis of Integer Timed Petri Nets
    Wan, Min
    Ciardo, Gianfranco
    SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 595 - 608
  • [42] Symbolic Reachability Analysis of B Through PROB and LTSMIN
    Bendisposto, Jens
    Koerner, Philipp
    Leuschel, Michael
    Meijer, Jeroen
    van de Pol, Jaco
    Treharne, Helen
    Whitefield, Jorden
    INTEGRATED FORMAL METHODS (IFM 2016), 2016, 9681 : 275 - 291
  • [43] Symbolic reachability for process algebras with recursive data types
    Blom, Stefan
    van de Pol, Jaco
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2008, PROCEEDINGS, 2008, 5160 : 81 - 95
  • [44] Subsumer-First: Steering Symbolic Reachability Analysis
    Rybalchenko, Andrey
    Singh, Rishabh
    MODEL CHECKING SOFTWARE, 2009, 5578 : 192 - 204
  • [45] Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
    Duran, Francisco
    Eker, Steven
    Escobar, Santiago
    Meseguer, Jose
    Talcott, Carolyn
    22ND INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'11), 2011, 10 : 31 - 40
  • [46] Symbolic reachability analysis of lazy linear hybrid automata
    Jha, Susmit
    Brady, Bryan A.
    Seshia, Sanjit A.
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2007, 4763 : 241 - +
  • [47] Symbolic reachability analysis based on SAT-solvers
    Abdulla, PA
    Bjesse, P
    Eén, N
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2000, 1785 : 411 - 425
  • [48] Backward Symbolic Optimal Reachability in Weighted Timed Automata
    Parrot, Remi
    Lime, Didier
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2020, 2020, 12288 : 41 - 57
  • [49] Multi-Core BDD Operations for Symbolic Reachability
    van Dijk, Tom
    Laarman, Alfons
    van de Pol, Jaco
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2013, 296 : 127 - 143
  • [50] Improving symbolic reachability analysis by means of activity profiles
    Cabodi, G
    Camurati, P
    Quer, S
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (09) : 1065 - 1075
12345