![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
BlenX Static and Dynamic Semantics
We introduce a new programming language called BlenX. It is strongly inspired to process calculi and it is an evolution of Beta-binders. It has been specifically designed and implemented to model and simulate bio...
-
Chapter and Conference Paper
BlenX4Bio – BlenX for Biologists
We introduce BlenX4Bio, a high-level interface for the programming language BlenX. BlenX4Bio allows biologists to write BlenX programs without having any programming skills. The main elements of a biological mode...
-
Chapter and Conference Paper
Formal Analysis of BPMN Via a Translation into COWS
A translation of the Business Process Modeling Notation into the process calculus COWS is presented. The stochastic extension of COWS is then exploited to address quantitative reasoning about the behaviour of ...
-
Chapter and Conference Paper
Beta Binders for Biological Interactions
This paper presents binders and operators, in the process calculi tradition, to reason about biological interactions.
-
Chapter and Conference Paper
Model Checking Biological Systems Described Using Ambient Calculus
We propose a way of performing model checking analysis for biological systems. The technics were developed for a CTL* logic built upon Ambient Calculus.
-
Chapter and Conference Paper
Modeling Kohn Interaction Maps with Beta-Binders: An Example
We represent a subset of the mammalian cell cycle Kohn interaction map using Beta-binders, a formalism inspired to the pi-calculus and enriched with binders that allow the description of enclosing surfaces equ...
-
Chapter
Operational Patterns in Beta-Binders
As a preliminary step in testing the expressiveness of Beta-binders against realistic case studies, we comment on a number of operational properties of the formalism and present a set of derived patterns that ...
-
Chapter and Conference Paper
The weak late π-calculus semantics as observation equivalence
We show that the Weak Late π-calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substit...
-
Chapter and Conference Paper
A π-calculus with explicit substitutions: The late semantics
A new formulation of the π-calculus, where name instantiation is handled explicitly, is presented. The explicit handling of name instantiation allows us to reduce the π-calculus transitional semantics to a standa...
-
Chapter and Conference Paper
A fully parallel calculus of synchronizing processes
We propose a fully parallel calculus of synchronizing processes. The calculus was deeply inspired by LOTOS, of which it inherits multi-party synchronization in process parallel composition. On the other hand, its...