Results 1 
5 of
5
Stochastic Calculus of Wrapped Compartments ∗
"... The Calculus of Wrapped Compartments (CWC) is a variant of the Calculus of Looping Sequences (CLS). While keeping the same expressiveness, CWC strongly simplifies the development of automatic tools for the analysis of biological systems. The main simplification consists in the removal of the sequenc ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The Calculus of Wrapped Compartments (CWC) is a variant of the Calculus of Looping Sequences (CLS). While keeping the same expressiveness, CWC strongly simplifies the development of automatic tools for the analysis of biological systems. The main simplification consists in the removal of the sequencing operator, thus lightening the formal treatment of the patterns to be matched in a term (whose complexity in CLS is strongly affected by the variables matching in the sequences). We define a stochastic semantics for this new calculus. As an application we model the interaction between macrophages and apoptotic neutrophils and a mechanism of gene regulation in E.Coli. 1
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
 JOURNAL OF AUTOMATA, LANGUAGES AND COMBINATORICS
"... Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automata for the analysis of security aspects in such protocols. To this aim, we define an insecure communication scenario for ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automata for the analysis of security aspects in such protocols. To this aim, we define an insecure communication scenario for team automata that is general enough to encompass various communication protocols. We then reformulate the Generalized NonDeducibility on Compositions schema—originally introduced in the context of process algebrae—in terms of team automata. Based on the resulting team automata framework, we subsequently develop two analysis strategies that can be used to verify security properties of communication protocols. Indeed, the paper concludes with two case studies in which we show how our framework can be used to prove integrity and secrecy in two different settings: We show how integrity is guaranteed in a team automaton model of a particular instance of the Efficient Multichained Stream Signature protocol, a communication protocol for signing digital streams that provides some robustness against packet loss, and we show how secrecy is preserved when a member of a multicast group leaves the group in a particular run of the complementary variable approach to the NRoot/Leaf pairwise keys protocol.
Probabilistic Timed Automata for Security Analysis and Design
"... 4 Abstract The usefulness of formal methods for the description and verification of complex systems is nowadays widely accepted. While some system properties can be studied in a nontimed and nonprobabilistic setting, others, such as quantitative security properties, system performance andreliabili ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
4 Abstract The usefulness of formal methods for the description and verification of complex systems is nowadays widely accepted. While some system properties can be studied in a nontimed and nonprobabilistic setting, others, such as quantitative security properties, system performance andreliability properties, require a timed and probabilistic description of the system. This thesis focuses on methods for the formal modeling of probabilistic timed systems, and on algorithms forthe automated verification of their properties. The models considered describe the behavior of a system in terms of time and probability, and the formal description languages used are based onextensions of Timed Automata, Markov Decision Processes and combinations of them.
Under consideration for publication in Formal Aspects of Computing Parametric Probabilistic Transition Systems for System Design and Analysis 1
"... Abstract. We develop a model of Parametric Probabilistic Transition Systems, where probabilities associated with transitions may be parameters. We show how to find instances of the parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a c ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We develop a model of Parametric Probabilistic Transition Systems, where probabilities associated with transitions may be parameters. We show how to find instances of the parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a certain state. As an application, we model a probabilistic non–repudiation protocol with a Parametric Probabilistic Transition System. The theory we develop allows us to find instances that maximize the probability that the protocol ends in a fair state (no participant has an advantage over the others).
This work is licensed under the Creative Commons Attribution License. A Calculus for Topological Quantum Computation
, 2014
"... Recent developments in theoretical physics have highlighted interesting topological features of some particular twodimensional entities called anyons. Kitaev suggested that these features can be used to realise robust quantum computation, thus introducing the paradigm of topological quantum comput ..."
Abstract
 Add to MetaCart
Recent developments in theoretical physics have highlighted interesting topological features of some particular twodimensional entities called anyons. Kitaev suggested that these features can be used to realise robust quantum computation, thus introducing the paradigm of topological quantum computation (TQC). The mathematics and physics of anyons is currently subject to intense investigations in all areas related to the study of quantum computation from both the foundational and the implementation viewpoint. In this paper we take a computer science viewpoint of TQC by presenting a quantum calculus whose terms are anyons and operations are suitable representations of the braid group on the terms. 1