Computing bottom SCCs symbolically using transition guided reduction

DOI10.1007/978-3-030-81685-8_24MaRDI QIDQ832201zbMATH OpenOpenAlexFDO

Authors Nikola Beneš, Luboš Brim, Samuel Pastva, D. Šafránek

Publication date 25 March 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-81685-8_24

zbMATH Keywords

Boolean networksymbolic algorithmbottom SCC

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Symbolic coloured SCC decomposition
• scientific article; zbMATH DE number 1979545
• scientific article; zbMATH DE number 2079387
• Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps

Cites work

• scientific article; zbMATH DE number 1701768 (Why is no real title available?)
• scientific article; zbMATH DE number 2079387 (Why is no real title available?)
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Attractor analysis of asynchronous Boolean models of signal transduction networks
• Chaos, strange attractors, and fractal basin boundaries in nonlinear dynamics
• Computing maximal and minimal trap spaces of Boolean networks
• Concurrency in Boolean networks
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Facetal abstraction for non-linear dynamical systems based on δ-decidable SMT
• Graph-Based Algorithms for Boolean Function Manipulation
• Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
• Model-checking large structured Markov chains.
• Sequential reprogramming of biological network fate
• Strength-based decomposition of the property Büchi automaton for faster model checking

Cited in

(3)

• Aeon 2021: bifurcation decision trees in Boolean networks
• A truly symbolic linear-time algorithm for SCC decomposition
• Attractor identification in asynchronous Boolean dynamics with network reduction

Describes a project that uses

Uses Software

• Ginsim
• PyBoolNet

This page was built for publication: Computing bottom SCCs symbolically using transition guided reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832201)