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

    Process Calculi Abstractions for Biology

    Several approaches have been proposed to model biological systems by means of the formal techniques and tools available in computer science. To mention just a few of them, some representations are inspired by ...

    Maria Luisa Guerriero, Davide Prandi, Corrado Priami in Algorithmic Bioprocesses (2009)

  3. No Access

    Chapter and Conference Paper

    BlenX4BioBlenX for Biologists

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

    Corrado Priami, Paolo Ballarini, Paola Quaglia in Computational Methods in Systems Biology (2009)

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

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

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

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