Skip to main content

and
  1. No Access

    Chapter

    Quantitative Analysis of Services

    We show a number of applications of the tools which have been developed within the sensoria project to perform quantitative analysis of services. These tools are formally grounded on source calculi which allow th...

    Igor Cappello, Allan Clark, Stephen Gilmore in Rigorous Software Engineering for Service-… (2011)

  2. No Access

    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 ...

    Paola Quaglia, Stefano Schivo in Trustworthly Global Computing (2010)

  3. No Access

    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...

    Igor Cappello, Paola Quaglia in Trustworthly Global Computing (2010)

  4. No Access

    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 ...

    Davide Prandi, Paola Quaglia, Nicola Zannone in Coordination Models and Languages (2008)

  5. No Access

    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 ...

    Paola Quaglia in Concurrency, Graphs and Models (2008)

  6. Chapter and Conference Paper

    Stochastic COWS

    A stochastic extension of COWS is presented. First the formalism is given an operational semantics leading to finitely branching transition systems. Then its syntax and semantics are enriched along the lines o...

    Davide Prandi, Paola Quaglia in Service-Oriented Computing – ICSOC 2007 (2007)

  7. No Access

    Book and Conference Proceedings

    Global Computing

    IST/FET International Workshop, GC 2004 Rovereto, Italy, March 9-12, 2004 Revised Selected Papers

    Corrado Priami, Paola Quaglia in Lecture Notes in Computer Science (2005)

  8. No Access

    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.

    Corrado Priami, Paola Quaglia in Computational Methods in Systems Biology (2005)

  9. No Access

    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.

    Radu Mardare, Corrado Priami, Paola Quaglia in Computational Methods in Systems Biology (2005)

  10. No Access

    Chapter and Conference Paper

    Performance Analysis of a UML Micro-business Case Study

    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 int...

    Katerina Pokozy-Korenblat, Corrado Priami, Paola Quaglia in Global Computing (2005)

  11. Chapter and Conference Paper

    On Synchronous and Asynchronous Mobile Processes

    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 u...

    Paola Quaglia, David Walker in Foundations of Software Science and Computation Structures (2000)

  12. No Access

    Chapter and Conference Paper

    Pi-Congruences as CCS Equivalences

    We show the coincidence of non-ground π-calculus and πξ-calculus, a CCS-like calculus that allows processes to be explicitly represented as temporary functions of input parameters, and as permanent functions o...

    Paola Quaglia in Algebraic Methodology and Software Technology (1999)

  13. No Access

    Chapter and Conference Paper

    On encoding in

    This paper is about the encoding of , the polyadic π-calculus, in , the monadic π-calculus. A type system for processes is introduced which captures the interaction regime underlying the encoding of pro...

    Paola Quaglia, David Walker in Foundations of Software Technology and The… (1998)

  14. No Access

    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...

    GianLuigi Ferrari, Ugo Montanari in Mathematical Foundations of Computer Scien… (1994)

  15. 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...

    Diego Latella, Paola Quaglia in TAPSOFT'93: Theory and Practice of Software Development (1993)