Share This Author
Towards a Unifying Theory for Choreography Conformance and Contract Compliance
The main result of this paper is the definition of an effective procedure that can be used to verify whether a service with a given contract can correctly play a specific role within a choreography.
Replication vs. Recursive Definitions in Channel Based Calculi
The following discrimination result is proved between replication and recursive definitions: the termination of processes is an undecidable property in the core of CCS, provided that recursive process definitions are allowed, while termination turns out to be decidable when only replication is permitted.
A Calculus for Long-Running Transactions
This paper designs an extension of the asynchronous π-calculus with long-running transactions (and sequences) – the πt -calculus, by defining a semantics and providing a correct encoding of ρt-Calculus into asynchronous ρ-cal calculus.
Comparing Recursion, Replication, and Iteration in Process Calculi
This work extends the results in [BGZ03] by considering iteration, a third mechanism for expressing infinite behaviours, and shows that convergence (i.e., the existence of a terminating computation) is undecidable in the calculus with replication, whereas it is decidable inthe calculus with iteration.
A Process Algebraic View of Linda Coordination Primitives
Parameterized Verification of Ad Hoc Networks
A complete picture of the decidability boundaries of decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement according to different assumptions on communication graphs, namely static, mobile, and bounded path topology is drawn.
SCC: A Service Centered Calculus
This study introduces SCC, a process calculus that features explicit notions of service definition, service invocation and session handling, and presents syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives.
On the Expressiveness of Linda Coordination Primitives
A process algebra containing the coordination primitives of Linda is introduced, showing that there exists a deadlock-preserving simulation of such nets by finite P/T nets, a formalism where termination is decidable.
Foundations of Web Transactions
A timed extension of π-calculus with a transaction construct – the calculus Webπ – is studied, finding that the discriminating power of timed bisimilarity is weaker when local urgency is dropped.
Contract Compliance and Choreography Conformance in the Presence of Message Queues
This paper approaches a more realistic scenario in which the messages containing the invocations are queued in the called service and relates the proposed theory of contract compliance with choreography specifications a la WS-CDL where activities are interpreted as pairs of send and receive events.