Computing bottom SCCs symbolically using transition guided reduction

DOI10.1007/978-3-030-81685-8_24zbMATH Open1493.68240OpenAlexW3183793525MaRDI QIDQ832201FDOQ832201

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

Publication date: 25 March 2022

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

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

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)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Title not available (Why is that?)
• Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics
• Title not available (Why is that?)
• Attractor analysis of asynchronous Boolean models of signal transduction networks
• Model-checking large structured Markov chains.
• Computing maximal and minimal trap spaces of Boolean networks
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Title not available (Why is that?)
• Facetal abstraction for non-linear dynamical systems based on δ-decidable SMT
• Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Sequential reprogramming of biological network fate
• Concurrency in Boolean networks

Cited In (3)

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

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)