Computing bottom SCCs symbolically using transition guided reduction
From MaRDI portal
Publication:832201
DOI10.1007/978-3-030-81685-8_24zbMath1493.68240OpenAlexW3183793525MaRDI QIDQ832201
Samuel Pastva, Nikola Beneš, David Š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
Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Aeon 2021: bifurcation decision trees in Boolean networks ⋮ Attractor identification in asynchronous Boolean dynamics with network reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-checking large structured Markov chains.
- Attractor analysis of asynchronous Boolean models of signal transduction networks
- Computing maximal and minimal trap spaces of Boolean networks
- AEON: attractor bifurcation analysis of parametrised Boolean networks
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics
- Graph-Based Algorithms for Boolean Function Manipulation
- 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
This page was built for publication: Computing bottom SCCs symbolically using transition guided reduction
