CONCUR 2013 – Concurrency Theory
24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings
Page
%P
23 Result(s)
-
Chapter and Conference Paper
From Theory to Practice in Transactional Composition of Web Services
We address the problem of composing Web Services in long-running transactional business processes, where compensations must be dealt with appropriately. The framework presented in this paper is a Java API called
-
Chapter and Conference Paper
Dynamic Graph Transformation Systems
We introduce an extension of Graph Grammars (GGs), called Dynamic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh productions operating on i...
-
Chapter and Conference Paper
Non-sequential Behaviour of Dynamic Nets
Dynamic nets are an extension of Petri nets where the net topology may change dynamically. This is achieved by allowing (i) tokens to be coloured with place names (carried on as data), (ii) transitions to designa...
-
Chapter and Conference Paper
Translating Orc Features into Petri Nets and the Join Calculus
Cook and Misra’s Orc is an elegant language for orchestrating distributed services, able to cover e.g. van der Aalst’s workflow patterns. We aim to understand the key novel features of Orc by comparing it with va...
-
Chapter and Conference Paper
A Fuzzy Approach for Negotiating Quality of Services
A central point when integrating services concerns to the description, agreement and enforcement of the quality aspect of service interaction, usually known as Service Level Agreement (SLA). This paper present...
-
Chapter and Conference Paper
Multiparty Sessions in SOC
Service oriented applications feature interactions among several participants over the network. Mechanisms such as correlation sets and two-party sessions have been proposed in the literature to separate messa...
-
Chapter and Conference Paper
Transactional Service Level Agreement
Several models based on process calculi have addressed the definition of linguistic primitives for handling long running transactions and Service Level Agreement (SLA) in service oriented applications. Neverth...
-
Chapter
Synchronous Multiparty Synchronizations and Transactions
In this paper we analyze how a powerful synchronization mechanism such as synchronous multiparty synchronizations, which is able to specify atomic reconfigurations of large systems, can be implemented using bi...
-
Chapter and Conference Paper
A Connector Algebra for P/T Nets Interactions
A quite flourishing research thread in the recent literature on component-based system is concerned with the algebraic properties of various kinds of connectors for defining well-engineered systems. In a recen...
-
Chapter and Conference Paper
Connector Algebras, Petri Nets, and BIP
In the area of component-based software architectures, the term connector has been coined to denote an entity (e.g. the communication network, middleware or infrastructure) that regulates the interaction of indep...
-
Chapter and Conference Paper
On Correlation Sets and Correlation Exceptions in ActiveBPEL
Correlation sets are a programming primitive that allows instance identification in orchestration languages. A correlation set is a set of properties (i.e., values carried on by messages) that are used to asso...
-
Book and Conference Proceedings
-
Chapter
A Survey on Basic Connectors and Buffers
Recent years have witnessed an increasing interest about a rigorous modelling of (different classes of) connectors. Here, the term connector is used to name entities that can regulate the interaction of possib...
-
Chapter and Conference Paper
From Hierarchical BIP to Petri Calculus
We focus on Hierarchical BIP, an extension of Joseph Sifakis et al’s BIP component framework, to provide a semantics-preserving, compositional encoding in the Petri calculus, a recently proposed algebra of sta...
-
Chapter and Conference Paper
Resolving Non-determinism in Choreographies
Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies –called whole-spectrum implementation– that rules out deterministic impleme...
-
Chapter and Conference Paper
On the Behaviour of General-Purpose Applications on Cloud Storages
Managing data over cloud infrastructures raises novel challenges with respect to existing and well studied approaches such as ACID and long running transactions. One of the main requirements is to provide avai...
-
Chapter
Behaviour, Interaction and Dynamics
The growth and diffusion of reconfigurable and adaptive systems motivate the foundational study of models of software connectors that can evolve dynamically, as opposed to the better understood notion of stati...
-
Chapter
A Normal Form for Stateful Connectors
In this paper we consider a calculus of connectors that allows for the most general combination of synchronisation, non-determinism and buffering. According to previous results, this calculus is tightly relate...
-
Chapter and Conference Paper
A Formal Analysis of the Global Sequence Protocol
The Global Sequence Protocol (GSP) is an operational model for replicated data stores, in which updates propagate asynchronously. We introduce the GSP-calculus as a formal model for GSP. We give a formal accou...
-
Chapter and Conference Paper
A Denotational View of Replicated Data Types
“Weak consistency” refers to a family of properties concerning the state of a distributed system. One of the key issues in their description is the way in which systems are specified. In this regard, a major a...
