5 Result(s)
within
Paola Quaglia
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
Approximate Model Checking of Stochastic COWS
Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the ...
-
Chapter and Conference Paper
A Tool for Checking Probabilistic Properties of COWS Services
We present a tool developed for fostering probabilistic model checking of services formally specified in Scows, a stochastic enrichment of the Calculus for Orchestration of Web Services. The tool, called Scows_lt...
-
Chapter
On Beta-Binders Communications
Beta-binders is a bio-inspired formalism with a formal reduction semantics in the process calculi style. The terms of the language are boxes with an internal processing engine and provided with interfaces for ...
-
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...
