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 条
  • [31] Planar and Grid Graph Reachability Problems
    Eric Allender
    David A. Mix Barrington
    Tanmoy Chakraborty
    Samir Datta
    Sambuddha Roy
    Theory of Computing Systems, 2009, 45 : 675 - 723
  • [32] Program analysis via graph reachability
    Reps, T
    INFORMATION AND SOFTWARE TECHNOLOGY, 1998, 40 (11-12) : 701 - 726
  • [33] Program analysis via graph reachability
    Reps, T
    LOGIC PROGRAMMING - PROCEEDINGS OF THE 1997 INTERNATIONAL SYMPOSIUM, 1997, : 5 - 19
  • [34] Planar and Grid Graph Reachability Problems
    Allender, Eric
    Barrington, David A. Mix
    Chakraborty, Tanmoy
    Datta, Samir
    Roy, Sambuddha
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 675 - 723
  • [35] Maximum reachability preserved graph cut
    Miao, Dongjing
    Li, Jianzhong
    Cai, Zhipeng
    THEORETICAL COMPUTER SCIENCE, 2020, 840 (840) : 187 - 198
  • [36] Protocol Verification by Simultaneous Reachability Graph
    Wang, Cailu
    Tao, Yuegang
    Zhou, Ying
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (08) : 1727 - 1730
  • [37] Decentralized Graph Processing for Reachability Queries
    Mathys, Joel
    Fritsch, Robin
    Wattenhofer, Roger
    ADVANCED DATA MINING AND APPLICATIONS (ADMA 2022), PT I, 2022, 13725 : 505 - 519
  • [38] Observability Analysis of Interpreted Petri Nets under Partial State Observations using Estimations Reachability Graph
    Aguirre-Salas, Luis
    Santoyo-Sanchez, Alejandra
    2008 IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, PROCEEDINGS, 2008, : 129 - +
  • [39] Symbolic reachability computation for families of linear vector fields
    Lafferriere, G
    Pappas, GJ
    Yovine, S
    JOURNAL OF SYMBOLIC COMPUTATION, 2001, 32 (03) : 231 - 253
  • [40] Symbolic reachability analysis of probabilistic linear hybrid automata
    Mutsuda, Y
    Kato, T
    Yamane, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (11) : 2972 - 2981
12345