6,150 research outputs found
A criterion for separating process calculi
We introduce a new criterion, replacement freeness, to discern the relative
expressiveness of process calculi. Intuitively, a calculus is strongly
replacement free if replacing, within an enclosing context, a process that
cannot perform any visible action by an arbitrary process never inhibits the
capability of the resulting process to perform a visible action. We prove that
there exists no compositional and interaction sensitive encoding of a not
strongly replacement free calculus into any strongly replacement free one. We
then define a weaker version of replacement freeness, by only considering
replacement of closed processes, and prove that, if we additionally require the
encoding to preserve name independence, it is not even possible to encode a non
replacement free calculus into a weakly replacement free one. As a consequence
of our encodability results, we get that many calculi equipped with priority
are not replacement free and hence are not encodable into mainstream calculi
like CCS and pi-calculus, that instead are strongly replacement free. We also
prove that variants of pi-calculus with match among names, pattern matching or
polyadic synchronization are only weakly replacement free, hence they are
separated both from process calculi with priority and from mainstream calculi.Comment: In Proceedings EXPRESS'10, arXiv:1011.601
On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions
Several Markovian process calculi have been proposed in the literature, which
differ from each other for various aspects. With regard to the action
representation, we distinguish between integrated-time Markovian process
calculi, in which every action has an exponentially distributed duration
associated with it, and orthogonal-time Markovian process calculi, in which
action execution is separated from time passing. Similar to deterministically
timed process calculi, we show that these two options are not irreconcilable by
exhibiting three mappings from an integrated-time Markovian process calculus to
an orthogonal-time Markovian process calculus that preserve the behavioral
equivalence of process terms under different interpretations of action
execution: eagerness, laziness, and maximal progress. The mappings are limited
to classes of process terms of the integrated-time Markovian process calculus
with restrictions on parallel composition and do not involve the full
capability of the orthogonal-time Markovian process calculus of expressing
nondeterministic choices, thus elucidating the only two important differences
between the two calculi: their synchronization disciplines and their ways of
solving choices
A framework for protein and membrane interactions
We introduce the BioBeta Framework, a meta-model for both protein-level and
membrane-level interactions of living cells. This formalism aims to provide a
formal setting where to encode, compare and merge models at different
abstraction levels; in particular, higher-level (e.g. membrane) activities can
be given a formal biological justification in terms of low-level (i.e.,
protein) interactions. A BioBeta specification provides a protein signature
together a set of protein reactions, in the spirit of the kappa-calculus.
Moreover, the specification describes when a protein configuration triggers one
of the only two membrane interaction allowed, that is "pinch" and "fuse". In
this paper we define the syntax and semantics of BioBeta, analyse its
properties, give it an interpretation as biobigraphical reactive systems, and
discuss its expressivity by comparing with kappa-calculus and modelling
significant examples. Notably, BioBeta has been designed after a bigraphical
metamodel for the same purposes. Hence, each instance of the calculus
corresponds to a bigraphical reactive system, and vice versa (almost).
Therefore, we can inherith the rich theory of bigraphs, such as the automatic
construction of labelled transition systems and behavioural congruences
A Calculus for Orchestration of Web Services
Service-oriented computing, an emerging paradigm for distributed computing based on the use of services, is calling for the development of tools and techniques to build safe and trustworthy systems, and to analyse their behaviour. Therefore, many researchers have proposed to use process calculi, a cornerstone of current foundational research on specification and analysis of concurrent, reactive, and distributed systems. In this paper, we follow this approach and introduce CWS, a process calculus expressly designed for specifying and combining service-oriented applications, while modelling their dynamic behaviour. We show that CWS can model all the phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, orchestration, deployment, reconfiguration and execution. We illustrate the specification style that CWS supports by means of a large case study from the automotive domain and a number of more specific examples drawn from it
Towards Formal Interaction-Based Models of Grid Computing Infrastructures
Grid computing (GC) systems are large-scale virtual machines, built upon a
massive pool of resources (processing time, storage, software) that often span
multiple distributed domains. Concurrent users interact with the grid by adding
new tasks; the grid is expected to assign resources to tasks in a fair,
trustworthy way. These distinctive features of GC systems make their
specification and verification a challenging issue. Although prior works have
proposed formal approaches to the specification of GC systems, a precise
account of the interaction model which underlies resource sharing has not been
yet proposed. In this paper, we describe ongoing work aimed at filling in this
gap. Our approach relies on (higher-order) process calculi: these core
languages for concurrency offer a compositional framework in which GC systems
can be precisely described and potentially reasoned about.Comment: In Proceedings DCM 2013, arXiv:1403.768
On the relative expressiveness of higher-order session processes
By integrating constructs from the Ī»-calculus and the Ļ-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOĻ, the higher-order Ļ-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOĻ which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. By exploring a new bisimulation for HO, we show that HO can encode HOĻ fully abstractly (upĀ to typed contextual equivalence) more precisely and efficiently than the first-order session Ļ-calculus (Ļ). Overall, under session types, HOĻ, HO, and Ļ are equally expressive; however, HOĻ and HO are more tightly related than HOĻ and Ļ
- ā¦