Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations

被引:2
|
作者
Le Coent, Adrien [1 ]
Fribourg, Laurent [2 ]
Soulat, Romain [3 ]
机构
[1] Univ Paris Saclay, CNRS, ENS Cachan, CMLA, 61 Av President Wilson, F-94235 Cachan, France
[2] Univ Paris Saclay, CNRS, ENS Cachan, LSV, 61 Av President Wilson, F-94235 Cachan, France
[3] Thales Res & Technol, 1 Av Augustin Fresnel, F-91767 Palaiseau, France
来源
REACHABILITY PROBLEMS, RP 2016 | 2016年 / 9899卷
关键词
REPRESENTATION; ALGORITHM; DYNAMICS;
D O I
10.1007/978-3-319-45994-3_10
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a compositional method which allows to over-approximate the set of attractors and under-approximate the set of basins of attraction of a Boolean network (BN). This merely consists in replacing a global fixed-point computation by a composition of local fixedpoint computations. Once these approximations have been computed, it becomes much more tractable to generate the exact sets of attractors and basins of attraction. We illustrate the interest of our approach on several examples, among which is a BN modeling a railway interlocking system with 50 nodes and millions of attractors.
引用
收藏
页码:134 / 147
页数:14
相关论文
共 27 条
  • [1] STOCHASTIC FIXED-POINT ITERATIONS FOR NONEXPANSIVE MAPS: CONVERGENCE AND ERROR BOUNDS
    Bravo, Mario
    Cominetti, Roberto
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2024, 62 (01) : 191 - 219
  • [2] Restarted Pulay mixing for efficient and robust acceleration of fixed-point iterations
    Pratapa, Phanisri P.
    Suryanarayana, Phanish
    CHEMICAL PHYSICS LETTERS, 2015, 635 : 69 - 74
  • [3] Bratu's problem: A novel approach using fixed-point iterations and Green's functions
    Kafri, H. Q.
    Khuri, S. A.
    COMPUTER PHYSICS COMMUNICATIONS, 2016, 198 : 97 - 104
  • [4] FIXED-POINT SEARCH WITH TWO ARBITRARY EQUAL PHASE SHIFTS FOR ANY NUMBER OF ITERATIONS
    Li, Xiangrong
    Li, Dafa
    Huang, Hongtao
    Li, Xinxin
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2010, 8 (07) : 1075 - 1087
  • [5] One Solution of the Accurate Summation Using Fixed-point Accumulator
    Jankovic, Jelena
    Subotic, Milos
    Marinkovic, Vladimir
    2015 23RD TELECOMMUNICATIONS FORUM TELFOR (TELFOR), 2015, : 508 - 511
  • [6] On the Fixed-Point Accuracy Analysis and Optimization of FFT Units with CORDIC Multipliers
    Sarbishei, Omid
    Radecka, Katarzyna
    2011 20TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH-20), 2011, : 62 - 69
  • [7] Accelerating Fixed-Point Simulations Using Width Reconfigurable Hardware Architectures
    Shahin, Keyvan
    Huebner, Michael
    2021 31ST INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS (FPL 2021), 2021, : 275 - 276
  • [8] Fixed-point Accuracy Analysis of Datapaths with Mixed CORDIC and Polynomial Computations
    Sarbishei, O.
    Radecka, K.
    2012 17TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2012, : 789 - 794
  • [9] Performance Analysis and Parameter Optimization of the Optimal Fixed-Point Quantum Search
    Bao, Tianyi
    Huang, Duan
    APPLIED SCIENCES-BASEL, 2019, 9 (17):
  • [10] Design of Fixed-Point Processing Based LDPC Codes Using EXIT Charts
    Zuo, Xin
    Maunder, Robert G.
    Hanzo, Lajos
    2011 IEEE VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2011,