Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
On the complexity of verifying concurrent transition systems
Information and Computation
Analysis of Petri Nets with a Dynamic Priority Method
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Priority and abstraction in process algebra
Information and Computation
Refining dynamics of gene regulatory networks in a stochastic π-calculus framework
Transactions on computational systems biology XIII
The combinatorics of modeling and analyzing biological systems
Natural Computing: an international journal
The attributed pi-calculus with priorities
Transactions on Computational Systems Biology XII
Static analysis of biological regulatory networks dynamics using abstract interpretation
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
The Process Hitting is a recently introduced framework designed for the modelling of concurrent systems. Its originality lies in a compact representation of both components of the model and its corresponding actions: each action can modify the status of a component, and is conditioned by the status of at most one other component. This allowed to define very efficient static analysis based on local causality to compute reachability properties. However, in the case of cooperations between components (for example, when two components are supposed to interact with a third one only when they are in a given configuration), the approach leads to an over-approximated interleaving between actions, because of the pure asynchronous semantics of the model. To address this issue, we propose an extended definition of the framework, including priority classes for actions. In this paper, we focus on a restriction of the Process Hitting with two classes of priorities and a specific behaviour of the components, that is sufficient to tackle the aforementioned problem of cooperations. We show that this class of Process Hitting models allows to represent any Asynchronous Discrete Networks, either Boolean or multivalued. Then we develop a new refinement for the under-approximation of the static analysis to give accurate results for this class of Process Hitting models. Our method thus allows to efficiently under-approximate reachability properties in Asynchronous Discrete Networks; it is in particular conclusive on reachability properties in a 94 components Boolean network, which is unprecedented.