SOCK: A Calculus for Service Oriented Computing

Guidi, Claudio; Lucchi, Roberto; Gorrieri, Roberto; Busi, Nadia; Zavattaro, Gianluigi

doi:10.1007/11948148_27

Cited by 128 publications

(107 citation statements)

References 8 publications

Supporting

Mentioning

106

Contrasting

Order By: Relevance

“…From the theoretical point of view, the formalisms closest to ours are Orc and Klaim. In fact, to define Korc, we have chosen them as representative of the broader classes of orchestration calculi (as, e.g., [28,10,23,11,7]) and coordination calculi for network-aware and mobility programming (as, e.g., [21,24,12,39]). Relatively to these calculi, Korc does not provide new primitives, but it permits experimenting and reasoning on a novel programming paradigm combining orchestration and coordination operators.…”

Section: Discussionmentioning

confidence: 99%

“…CaSPiS's implementation is based on the generic Java framework IMC [2] that provides recurrent mechanisms for network applications and, hence, can be used as a middleware for the implementation of different process calculi. JOLIE [32] is an interpreter written in Java for a programming language based on the process calculus SOCK [23], which is a formalism inspired by the WS-BPEL language for formalizing some fundamental concepts of Service-Oriented Computing, such as the design of a service behaviour, its deployment, and the composition of services within a system. JSCL [20] is a Java-based coordination middleware for services based on the event notification paradigm of the Signal Calculus [19], a variant of the π-calculus with explicit primitives to deal with event notification and component distribution.…”

Section: Discussionmentioning

confidence: 99%

“…Among the many proposed formalisms (see, e.g., [28,8,10,23,11,7]), we will focus on Orc [31,40], a task orchestration language with applications in workflow, business process management, and web service orchestration. Orc is the This work has been partially sponsored by the EU project ASCENS, 257414. result of a tension between simplicity and expressiveness, and its primitives, differently from most the formalisms mentioned above, focus on orchestration rather than on communication.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Orchestrating Tuple-Based Languages

Nicola

Margheri

Tiezzi

2012

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a programming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi. To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client applications to access information about their goods and to place orders.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Orchestrating Tuple-Based Languages

Nicola

Margheri

Tiezzi

2012

Trustworthy Global Computing

View full text Add to dashboard Cite

show abstract

“…This is necessary when a service of a process fails during runtime or for finding redundant services. COWS [9] and SOCK [10] are designed for the purpose of automatic service composition. Furthermore, process algebras are often combined with other formalisms in order to be able to specify more aspects of a service in a formal manner.…”

Section: Formal Methods For Verifying Interaction Soundnessmentioning

confidence: 99%

Distributed Execution of S-BPM Business Processes

Aitenbichler

Borgert

Mühlhäuser

2011

Subject-Oriented Business Process Management

View full text Add to dashboard Cite

Abstract. Subject-oriented business process management (S-BPM) introduces a new technique for process modeling that emphasizes the importance of the actors in business processes (subjects) and gives a balanced consideration to subjects, their actions, and goals. Because of the formal foundation and the clear declaration of subjects, S-BPM allows the distributed modeling and execution of processes, without losing the capability to verify the compatibility of processes. Executing cooperating processes in a distributed system also poses new requirements to the communication middleware, which is responsible for routing messages from one process instance to a remote peer process instance. In this paper, we describe an engine to execute S-BPM process choreographies. It is based on subject-oriented process modeling and a publish/subscribe middleware as communication basis. Our process engine also runs on mobile devices.

show abstract

“…Examples are likely to include variations of the constructs presented in [8,6,3] and [7]. For that work, we will benefit from the fact that we rely on full standard syntax and reduction semantics of π, on which [8,6,3,7] are all based. We also plan to investigate the feasibility of using annotations to indicate which binding occurrences demand a relational treatment.…”

Section: Resultsmentioning

confidence: 99%

Relational Analysis for Delivery of Services

Nielson

Bauer

et al.

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that can both be checked and computed in polynomial time. In this paper we develop a static analysis in relational form which substantially improves the precision of the results obtained while being able to deal with the full generality of the syntax of processes. The analysis reveals a feasible complexity for practical examples and gives rise to a fast prototype. We use this prototype to automatically prove the correct delivery of messages for the implementation of an accident service, which is based on multiplexed communication, a crucial feature of global computing applications.

show abstract

SOCK: A Calculus for Service Oriented Computing

Cited by 128 publications

References 8 publications

Orchestrating Tuple-Based Languages

Orchestrating Tuple-Based Languages

Distributed Execution of S-BPM Business Processes

Relational Analysis for Delivery of Services

Contact Info

Product

Resources

About