Skip to main content

and
  1. No Access

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

    Corrado Priami, Paola Quaglia, Alessandro Romanel in CONCUR 2009 - Concurrency Theory (2009)

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

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

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

  5. No Access

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

    Gian-Luigi Ferrari, Ugo Montanari, Paola Quaglia in CONCUR '95: Concurrency Theory (1995)

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