Paola Quaglia - Academia.edu (original) (raw)

Papers by Paola Quaglia

Foundations of Software Technology and Theoretical Computer Science, 1998

This paper is about the encoding of p, the polyadic -calculus, in m, the monadic-calculus. A type... more This paper is about the encoding of p, the polyadic -calculus, in m, the monadic-calculus. A type system for m processes is introduced that captures the interactionregime underlying the encoding of p processes respecting a sorting. Afull-abstraction result is shown: two p processes are typed barbed congruent itheir m encodings are monadic-typed barbed congruent.1 IntroductionThe -calculus is a model of

Lecture Notes in Computer Science, 2005

ABSTRACT This paper presents a technique to carry out performance analysis of UML specifications.... more ABSTRACT This paper presents a technique to carry out performance analysis of UML specifications. We consider UML specifications composed of activity, sequence and deployment diagrams. Specifications are translated into the stochastic π-calculus, and quantitative analysis is then performed via the BioSpi tool. The approach is applied to a web-based Micro-business case study.

Lecture Notes in Computer Science, 2005

... Corrado Priami and Paola Quaglia ... The position of the two sites along the perimeter of the... more ... Corrado Priami and Paola Quaglia ... The position of the two sites along the perimeter of the box is irrelevant, just as the relative positions of β(x : Γ) and βh(y : ∆) in β(x : Γ) βh(y : ∆) [ P ], whichwill be let to be structurally congruent to βh(y : ∆) β(x : Γ) [ P ]. For similar reasons, the ...

Lecture Notes in Computer Science, 2005

The post-genomics era offers accurate descriptions of the fundamental compo-nents of living syste... more The post-genomics era offers accurate descriptions of the fundamental compo-nents of living systems, and in particular of proteins and cells. The understand-ing of the functional interactions of individual components when gathered in complex systems is however far from ...

Lecture Notes in Computer Science, 2005

The rapid progress in molecular biology has produced a large quantity of bi-ological data and has... more The rapid progress in molecular biology has produced a large quantity of bi-ological data and has led to the understanding of numerous interactions and relationships among a lot of biological entities. In particular, it has been pos-sible to acquire a deep knowledge in complex ...

Lecture Notes in Computer Science, 1994

... Dipartimento di Informatica, UniversitY. di Pisa {giangi, ugo, quaglia}~di, unipi, it Abstrac... more ... Dipartimento di Informatica, UniversitY. di Pisa {giangi, ugo, quaglia}~di, unipi, it Abstract. ... Our assumption on names could be fulfilled, for instance, by indexing names with the access path in the process leading to their declarations. ...

Lecture Notes in Computer Science, 2010

ABSTRACT We present a tool developed for fostering probabilistic model check- ing of services for... more ABSTRACT We present a tool developed for fostering probabilistic model check- ing of services formally specified in Scows, a stochastic enrichment of the Cal- culus for Orchestration of Web Services. The tool, called Scows lts, derives the Labelled Transition System associated to the term, and further generates the cor- responding Continuous Time Markov Chain in the same notation adopted by the PRISM model checker. Scows lts is first described and then seen at work against a small, yet representa- tive, application scenario.

Lecture Notes in Computer Science, 2005

We propose a way of performing model checking analysis for biological systems. The technics were ... more We propose a way of performing model checking analysis for biological systems. The technics were developed for a CTL* logic built upon Ambient Calculus. We introduce labeled syntax trees for ambient processes and use them as possible worlds in a Kripke structure developed for a propositional branching temporal logic. The accessibility relation over labeled syntax trees is generated by the reduction over corresponding Ambient Calculus processes. Providing the algorithms for calculating the accessibility relation between states, we open the perspective of using model checking algorithms developed for temporal logics in analyzing any phenomena described in Ambient Calculus. ⋆

Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12, 2012

ABSTRACT The relative expressive power of global priorities against the local priorities induced ... more ABSTRACT The relative expressive power of global priorities against the local priorities induced by a best-matching communication paradigm is investigated. Two specific languages are taken as referential cases: FAP and COWS. FAP is a finite fragment of asynchronous CCS with explicit priorities. COWS is a process calculus with naming that was specifically devised for modelling the orchestration of web services and where best-matching serves the purpose of giving precedence to service instances over service definitions. Two main results are shown, one on the negative and the other on the positive side. First, we prove the impossibility of encoding FAP into COWS if the translation has to meet a few specific and reasonable requirements. Second, we define an encoding of FAP into COWS that does not respect the above requirements. We show however that it still possesses desirable properties.

Lecture Notes in Computer Science, 1995

We show that the Weak Late ~r-calcuius semantics can be characterized as ordinary Observation con... more We show that the Weak Late ~r-calcuius semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, clue e.g. to communication, are explicitly handled via suitable constructors. The approach presented here allows to axiomatize the Weak Late lr-calcuhis semantics by simply adding Milner's r-laws to the proof system for the Strong equivalence. Resorting to Observation equivalence provides a framework which is general enough to allow to recover, in straightforward ways, other bisimulation semantics (e.g. Early, both Strong and Weak, and Dynamic and Branching, both Early and Late).

Theoretical Computer Science, 1996

A new formulation of the rr-calculus, where name instantiation is handled explicitly via the intr... more A new formulation of the rr-calculus, where name instantiation is handled explicitly via the introduction of a suitable combinator, is presented. The bisimulation semantics originally developed for the n-calculus are retrieved by giving the description of the corresponding strategies for name instantiation. The explicit handling of name instantiation allows us to reduce the rr-calculus transitional semantics to a standard SOS framework. Hence, T-calculus bisimulation models can take fully advantage of the SOS meta-theory developed for 'static' process calculi. For instance, complete axiomatic characterizations of n-calculus bisimulation equivalences can be automatically derived by turning SOS rules into equations. This formulation of the n-calculus is very promising for the development of semantic-based automatic verification tools.

Lecture Notes in Computer Science, 2009

... Corrado Priami, Paola Quaglia, and Alessandro Romanel ... The syntax of BlenX is parametrized... more ... Corrado Priami, Paola Quaglia, and Alessandro Romanel ... The syntax of BlenX is parametrized by three countable and pairwise disjoint sets: the set N of names (ranged over by n,m,n ,m ,...) the set X of vari-ables (ranged over by x,x ,...) and the set BV of basic values (ranged ...

Lecture Notes in Computer Science, 1993

. We propose a fully parallel calculus of synchronizing processes.The calculus was deeply inspire... more . We propose a fully parallel calculus of synchronizing processes.The calculus was deeply inspired by LOTOS, of which it inherits multi-partysynchronization in process parallel composition. On the other hand, its semanticsis not interleaving whereas LOTOS one is. The model we propose issomehow in between Milner's SCCS and ASCCS in that independent actionsare performed simultaneously, whereas synchronization is achieved by meansof delay. Also, delay is controlled in the sense that no ...

Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12, 2012

The main design features of a language for the management of the dynamic reconfiguration of graph... more The main design features of a language for the management of the dynamic reconfiguration of graphs are described. The language is domain-specific to model the behaviour of biological systems. Nodes of graphs are biochemical components, and undirected edges between them represent biochemical bonds. Also, nodes have a finite number of binding sites, and each of them can be the end-point

Lecture Notes in Computer Science, 2000

This paper studies the relationship between synchronous and asynchronous mobile processes, in the... more This paper studies the relationship between synchronous and asynchronous mobile processes, in the setting of the π-calculus. A type system for processes of the asynchronous monadic subcalculus is introduced and used to obtain a full-abstraction result: two processes of the polyadic π-calculus are typed barbed congruent iff their translations into the subcalculus are asynchronous-monadic-typed barbed congruent.

Lecture Notes in Computer Science, 2009

We introduce BlenX4Bio, a high-level interface for the programming language BlenX. BlenX4Bio allo... more 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 model are specified by filling in a number of tables. Such tables include descriptions of both static and dynamic aspects of the biological system at hand that can then be automatically mapped to BlenX programs for simulation and analysis within CoSBiLab software platform. In this paper we illustrate the main characteristics of BlenX4Bio through examples taken from biology textbooks.

Second International Conference on the Quantitative Evaluation of Systems (QEST'05), 2005

The similarities between systems of living entities and systems of concurrent processes may suppo... more The similarities between systems of living entities and systems of concurrent processes may support biological experiments in silico. Process calculi offer a formal framework to describe biological systems, as well as to analyse their behaviour, both from a qualitative and a quantitative point of view. A couple of little examples help us in showing how this can be done. We mainly focus our attention on the qualitative and quantitative aspects of the considered biological systems, and briefly illustrate which kinds of analysis are possible. We use a known stochastic calculus for the first example. We then present some statistics collected by repeatedly running the specification, that turn out to agree with those obtained by experiments in vivo. Our second example motivates a richer calculus. Its stochastic extension requires a non trivial machinery to faithfully reflect the real dynamic behaviour of biological systems.

Foundations of Software Technology and Theoretical Computer Science, 1998

This paper is about the encoding of p, the polyadic -calculus, in m, the monadic-calculus. A type... more This paper is about the encoding of p, the polyadic -calculus, in m, the monadic-calculus. A type system for m processes is introduced that captures the interactionregime underlying the encoding of p processes respecting a sorting. Afull-abstraction result is shown: two p processes are typed barbed congruent itheir m encodings are monadic-typed barbed congruent.1 IntroductionThe -calculus is a model of

Lecture Notes in Computer Science, 2005

ABSTRACT This paper presents a technique to carry out performance analysis of UML specifications.... more ABSTRACT This paper presents a technique to carry out performance analysis of UML specifications. We consider UML specifications composed of activity, sequence and deployment diagrams. Specifications are translated into the stochastic π-calculus, and quantitative analysis is then performed via the BioSpi tool. The approach is applied to a web-based Micro-business case study.

Lecture Notes in Computer Science, 2005

... Corrado Priami and Paola Quaglia ... The position of the two sites along the perimeter of the... more ... Corrado Priami and Paola Quaglia ... The position of the two sites along the perimeter of the box is irrelevant, just as the relative positions of β(x : Γ) and βh(y : ∆) in β(x : Γ) βh(y : ∆) [ P ], whichwill be let to be structurally congruent to βh(y : ∆) β(x : Γ) [ P ]. For similar reasons, the ...

Lecture Notes in Computer Science, 2005

The post-genomics era offers accurate descriptions of the fundamental compo-nents of living syste... more The post-genomics era offers accurate descriptions of the fundamental compo-nents of living systems, and in particular of proteins and cells. The understand-ing of the functional interactions of individual components when gathered in complex systems is however far from ...

Lecture Notes in Computer Science, 2005

The rapid progress in molecular biology has produced a large quantity of bi-ological data and has... more The rapid progress in molecular biology has produced a large quantity of bi-ological data and has led to the understanding of numerous interactions and relationships among a lot of biological entities. In particular, it has been pos-sible to acquire a deep knowledge in complex ...

Lecture Notes in Computer Science, 1994

... Dipartimento di Informatica, UniversitY. di Pisa {giangi, ugo, quaglia}~di, unipi, it Abstrac... more ... Dipartimento di Informatica, UniversitY. di Pisa {giangi, ugo, quaglia}~di, unipi, it Abstract. ... Our assumption on names could be fulfilled, for instance, by indexing names with the access path in the process leading to their declarations. ...

Lecture Notes in Computer Science, 2010

ABSTRACT We present a tool developed for fostering probabilistic model check- ing of services for... more ABSTRACT We present a tool developed for fostering probabilistic model check- ing of services formally specified in Scows, a stochastic enrichment of the Cal- culus for Orchestration of Web Services. The tool, called Scows lts, derives the Labelled Transition System associated to the term, and further generates the cor- responding Continuous Time Markov Chain in the same notation adopted by the PRISM model checker. Scows lts is first described and then seen at work against a small, yet representa- tive, application scenario.

Lecture Notes in Computer Science, 2005

We propose a way of performing model checking analysis for biological systems. The technics were ... more We propose a way of performing model checking analysis for biological systems. The technics were developed for a CTL* logic built upon Ambient Calculus. We introduce labeled syntax trees for ambient processes and use them as possible worlds in a Kripke structure developed for a propositional branching temporal logic. The accessibility relation over labeled syntax trees is generated by the reduction over corresponding Ambient Calculus processes. Providing the algorithms for calculating the accessibility relation between states, we open the perspective of using model checking algorithms developed for temporal logics in analyzing any phenomena described in Ambient Calculus. ⋆

Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12, 2012

ABSTRACT The relative expressive power of global priorities against the local priorities induced ... more ABSTRACT The relative expressive power of global priorities against the local priorities induced by a best-matching communication paradigm is investigated. Two specific languages are taken as referential cases: FAP and COWS. FAP is a finite fragment of asynchronous CCS with explicit priorities. COWS is a process calculus with naming that was specifically devised for modelling the orchestration of web services and where best-matching serves the purpose of giving precedence to service instances over service definitions. Two main results are shown, one on the negative and the other on the positive side. First, we prove the impossibility of encoding FAP into COWS if the translation has to meet a few specific and reasonable requirements. Second, we define an encoding of FAP into COWS that does not respect the above requirements. We show however that it still possesses desirable properties.

Lecture Notes in Computer Science, 1995

We show that the Weak Late ~r-calcuius semantics can be characterized as ordinary Observation con... more We show that the Weak Late ~r-calcuius semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, clue e.g. to communication, are explicitly handled via suitable constructors. The approach presented here allows to axiomatize the Weak Late lr-calcuhis semantics by simply adding Milner's r-laws to the proof system for the Strong equivalence. Resorting to Observation equivalence provides a framework which is general enough to allow to recover, in straightforward ways, other bisimulation semantics (e.g. Early, both Strong and Weak, and Dynamic and Branching, both Early and Late).

Theoretical Computer Science, 1996

A new formulation of the rr-calculus, where name instantiation is handled explicitly via the intr... more A new formulation of the rr-calculus, where name instantiation is handled explicitly via the introduction of a suitable combinator, is presented. The bisimulation semantics originally developed for the n-calculus are retrieved by giving the description of the corresponding strategies for name instantiation. The explicit handling of name instantiation allows us to reduce the rr-calculus transitional semantics to a standard SOS framework. Hence, T-calculus bisimulation models can take fully advantage of the SOS meta-theory developed for 'static' process calculi. For instance, complete axiomatic characterizations of n-calculus bisimulation equivalences can be automatically derived by turning SOS rules into equations. This formulation of the n-calculus is very promising for the development of semantic-based automatic verification tools.

Lecture Notes in Computer Science, 2009

... Corrado Priami, Paola Quaglia, and Alessandro Romanel ... The syntax of BlenX is parametrized... more ... Corrado Priami, Paola Quaglia, and Alessandro Romanel ... The syntax of BlenX is parametrized by three countable and pairwise disjoint sets: the set N of names (ranged over by n,m,n ,m ,...) the set X of vari-ables (ranged over by x,x ,...) and the set BV of basic values (ranged ...

Lecture Notes in Computer Science, 1993

. We propose a fully parallel calculus of synchronizing processes.The calculus was deeply inspire... more . We propose a fully parallel calculus of synchronizing processes.The calculus was deeply inspired by LOTOS, of which it inherits multi-partysynchronization in process parallel composition. On the other hand, its semanticsis not interleaving whereas LOTOS one is. The model we propose issomehow in between Milner's SCCS and ASCCS in that independent actionsare performed simultaneously, whereas synchronization is achieved by meansof delay. Also, delay is controlled in the sense that no ...

Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12, 2012

The main design features of a language for the management of the dynamic reconfiguration of graph... more The main design features of a language for the management of the dynamic reconfiguration of graphs are described. The language is domain-specific to model the behaviour of biological systems. Nodes of graphs are biochemical components, and undirected edges between them represent biochemical bonds. Also, nodes have a finite number of binding sites, and each of them can be the end-point

Lecture Notes in Computer Science, 2000

This paper studies the relationship between synchronous and asynchronous mobile processes, in the... more This paper studies the relationship between synchronous and asynchronous mobile processes, in the setting of the π-calculus. A type system for processes of the asynchronous monadic subcalculus is introduced and used to obtain a full-abstraction result: two processes of the polyadic π-calculus are typed barbed congruent iff their translations into the subcalculus are asynchronous-monadic-typed barbed congruent.

Lecture Notes in Computer Science, 2009

We introduce BlenX4Bio, a high-level interface for the programming language BlenX. BlenX4Bio allo... more 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 model are specified by filling in a number of tables. Such tables include descriptions of both static and dynamic aspects of the biological system at hand that can then be automatically mapped to BlenX programs for simulation and analysis within CoSBiLab software platform. In this paper we illustrate the main characteristics of BlenX4Bio through examples taken from biology textbooks.

Second International Conference on the Quantitative Evaluation of Systems (QEST'05), 2005

The similarities between systems of living entities and systems of concurrent processes may suppo... more The similarities between systems of living entities and systems of concurrent processes may support biological experiments in silico. Process calculi offer a formal framework to describe biological systems, as well as to analyse their behaviour, both from a qualitative and a quantitative point of view. A couple of little examples help us in showing how this can be done. We mainly focus our attention on the qualitative and quantitative aspects of the considered biological systems, and briefly illustrate which kinds of analysis are possible. We use a known stochastic calculus for the first example. We then present some statistics collected by repeatedly running the specification, that turn out to agree with those obtained by experiments in vivo. Our second example motivates a richer calculus. Its stochastic extension requires a non trivial machinery to faithfully reflect the real dynamic behaviour of biological systems.