Sufficient conditions for reachability in automata networks with priorities
type: Item
instance of: scholarly article
title: Sufficient conditions for reachability in automata networks with priorities
zbMATH Open document ID: 1332.68158
author: Maxime Folschette
author: Loïc Paulevé
author: Morgan Magnin
author: Olivier Roux
published in: Theoretical Computer Science
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 92C42
zbMATH DE Number: 6519476
zbMATH Keywords: discrete networks
zbMATH Keywords: abstract interpretation
zbMATH Keywords: reachability
zbMATH Keywords: qualitative models
zbMATH Keywords: systems biology
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.08.040
OpenAlex ID: W1922300461
cites work: Q4001257
cites work: Logical identification of all steady states: The concept of feedback loop characteristic states
cites work: Refining Dynamics of Gene Regulatory Networks in a Stochastic π-Calculus Framework
cites work: The combinatorics of modeling and analyzing biological systems
cites work: Priorities in process algebras
cites work: Priority and abstraction in process algebra
cites work: The Attributed Pi-Calculus with Priorities
cites work: Static analysis of biological regulatory networks dynamics using abstract interpretation
cites work: Dynamical behaviour of biological regulatory networks. I: Biological role of feedback loops and practical use of the concept of the loop- characteristic state
cites work: Under-approximation of reachability in multivalued asynchronous networks
cites work: On the complexity of verifying concurrent transition systems
cites work: Infinite Games
cites work: Analysis of Petri nets with a dynamic priority method
DOI: 10.1016/J.TCS.2015.08.040
description: scientific article; zbMATH DE number 6519476