In a previous paper the authors applied the Abstract Interpretation approach for approximating the probabilistic semantics of biological systems, modeled specifically using the Chemical Ground Form calculus. The methodology is based on the idea of representing a set of experiments, which differ only for the initial concentrations, by abstracting the multiplicity of reagents present in a solution, using intervals. In this paper, we refine the approach in order to address probabilistic termination properties. More in details, we introduce a refinement of the abstract LTS semantics and we abstract the probabilistic semantics using a variant of Interval Markov Chains. The abstract probabilistic model safely approximates a set of concrete experi...
We introduce a model for molecular reactions based on probabilistic rewriting rules. We give a proba...
We consider the problem of automatically verifying that a parameterized family of probabilistic conc...
We consider the problem of automatically verifying that a parameterized family of probabilistic conc...
In this paper we apply the Abstract Interpretation approach for approximating the behavior of biolo...
AbstractIn this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstra...
In this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstract Inter...
AbstractIn this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstra...
In this paper, we present a formalization of biological systems based on multiset rewriting and we i...
AbstractIn this paper, we present a formalization of biological systems based on multiset rewriting ...
International audienceWe consider the quantitative problem of obtaining lower-bounds on the probabil...
AbstractWhen modelling a complex system, such as one with distributed functionality, we need to choo...
We study the termination problem for probabilistic term rewrite systems. We prove that the interpret...
AbstractIn this note we show that probabilistic termination of concurrent programs is in many cases ...
We consider the quantitative problem of obtaining lower-bounds on the probability of termination of ...
When modelling a complex system, such as one with distributed functionality, we need to choose an ap...
We introduce a model for molecular reactions based on probabilistic rewriting rules. We give a proba...
We consider the problem of automatically verifying that a parameterized family of probabilistic conc...
We consider the problem of automatically verifying that a parameterized family of probabilistic conc...
In this paper we apply the Abstract Interpretation approach for approximating the behavior of biolo...
AbstractIn this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstra...
In this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstract Inter...
AbstractIn this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstra...
In this paper, we present a formalization of biological systems based on multiset rewriting and we i...
AbstractIn this paper, we present a formalization of biological systems based on multiset rewriting ...
International audienceWe consider the quantitative problem of obtaining lower-bounds on the probabil...
AbstractWhen modelling a complex system, such as one with distributed functionality, we need to choo...
We study the termination problem for probabilistic term rewrite systems. We prove that the interpret...
AbstractIn this note we show that probabilistic termination of concurrent programs is in many cases ...
We consider the quantitative problem of obtaining lower-bounds on the probability of termination of ...
When modelling a complex system, such as one with distributed functionality, we need to choose an ap...
We introduce a model for molecular reactions based on probabilistic rewriting rules. We give a proba...
We consider the problem of automatically verifying that a parameterized family of probabilistic conc...
We consider the problem of automatically verifying that a parameterized family of probabilistic conc...