Sufficient conditions for reachability in automata networks with priorities

DOI10.1016/j.tcs.2015.08.040zbMath1332.68158OpenAlexW1922300461MaRDI QIDQ896709

Maxime Folschette, Olivier Roux, Loïc Paulevé, Morgan Magnin

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.040

zbMATH Keywords

reachabilitysystems biologyabstract interpretationdiscrete networksqualitative models

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Systems biology, networks (92C42)

Related Items

SAF: SAT-based attractor finder in asynchronous automata networks ⋮ Maximum reachability preserved graph cut ⋮ Formalizing and enriching phenotype signatures using Boolean networks ⋮ Static analysis and stochastic search for reachability problem

Cites Work

• Unnamed Item
• Under-approximation of reachability in multivalued asynchronous networks
• The combinatorics of modeling and analyzing biological systems
• Logical identification of all steady states: The concept of feedback loop characteristic states
• Priorities in process algebras
• Dynamical behaviour of biological regulatory networks. I: Biological role of feedback loops and practical use of the concept of the loop- characteristic state
• On the complexity of verifying concurrent transition systems
• Priority and abstraction in process algebra
• Static analysis of Biological Regulatory Networks dynamics using abstract interpretation
• Refining Dynamics of Gene Regulatory Networks in a Stochastic π-Calculus Framework
• The Attributed Pi-Calculus with Priorities
• Infinite Games