CONCUR 2013 – Concurrency Theory
24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings
Page
%P
-
Chapter and Conference Paper
Relating Reversible Petri Nets and Reversible Event Structures, Categorically
Causal nets (CNs) are Petri nets where causal dependencies are modelled via inhibitor arcs. They play the role of occurrence nets when representing the behaviour of a concurrent and distributed system, even wh...
-
Chapter and Conference Paper
Towards a Truly Concurrent Semantics for Reversible CCS
Reversible CCS (RCCS) is a well-established, formal model for reversible communicating systems, which has been built on top of the classical Calculus of Communicating Systems (CCS). In its original formulation...
-
Chapter and Conference Paper
Implementation Correctness for Replicated Data Types, Categorically
Replicated Data Types (rdts) have been introduced as an abstraction for dealing with weakly consistent data stores, which may (temporarily) expose multiple, inconsistent views of their state. In the literature, r...
-
Chapter and Conference Paper
Reversible Occurrence Nets and Causal Reversible Prime Event Structures
One of the well-known results in concurrency theory concerns the relationship between event structures and occurrence nets: an occurrence net can be associated with a prime event structure, and vice versa. Mo...
-
Chapter and Conference Paper
A Choreography-Driven Approach to APIs: The OpenDXL Case Study
We propose a model-driven approach based on formal data-driven choreographies to model message-passing applications. We apply our approach to the threat intelligence exchange (TIE) services provided by McAfee thr...
-
Chapter and Conference Paper
Reversing P/T Nets
Petri Nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally rever...
-
Chapter
Data-Driven Choreographies à la Klaim
We propose Klaim as a suitable base for a novel choreographic framework
-
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...
-
Chapter and Conference Paper
Multiparty Testing Preorders
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between tw...
-
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...
-
Article
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
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
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...
-
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
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...
