Results 1  10
of
41
A Survey of Automated Web Service Composition Methods
 In Proceedings of the First International Workshop on Semantic Web Services and Web Process Composition, SWSWPC 2004
, 2004
"... Abstract. In today’s Web, Web services are created and updated on the fly. It’s already beyond the human ability to analysis them and generate the composition plan manually. A number of approaches have been proposed to tackle that problem. Most of them are inspired by the researches in crossenterpr ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
Abstract. In today’s Web, Web services are created and updated on the fly. It’s already beyond the human ability to analysis them and generate the composition plan manually. A number of approaches have been proposed to tackle that problem. Most of them are inspired by the researches in crossenterprise workflow and AI planning. This paper gives an overview of recent research efforts of automatic Web service composition both from the workflow and AI planning research community. 1
On Asynchrony in NamePassing Calculi
 In
, 1998
"... The asynchronous picalculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and Blue calculus. However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L), where: (a) only the output c ..."
Abstract

Cited by 87 (14 self)
 Add to MetaCart
The asynchronous picalculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and Blue calculus. However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L), where: (a) only the output capability of names may be transmitted; (b) there is no matching or similar constructs for testing equality between names. We study the basic operational and algebraic theory of Lpi. We focus on bisimulationbased behavioural equivalences, precisely on barbed congruence. We prove two coinductive characterisations of barbed congruence in Lpi, and some basic algebraic laws. We then show applications of this theory, including: the derivability of delayed input; the correctness of an optimisation of the encoding of callbyname lambdacalculus; the validity of some laws for Join.
A concurrent logical framework I: Judgments and properties
, 2003
"... The Concurrent Logical Framework, or CLF, is a new logical framework in which concurrent computations can be represented as monadic objects, for which there is an intrinsic notion of concurrency. It is designed as a conservative extension of the linear logical framework LLF with the synchronous con ..."
Abstract

Cited by 76 (26 self)
 Add to MetaCart
The Concurrent Logical Framework, or CLF, is a new logical framework in which concurrent computations can be represented as monadic objects, for which there is an intrinsic notion of concurrency. It is designed as a conservative extension of the linear logical framework LLF with the synchronous connectives# of intuitionistic linear logic, encapsulated in a monad. LLF is itself a conservative extension of LF with the asynchronous connectives #, & and #.
What is a `Good' Encoding of Guarded Choice?
 INFORMATION AND COMPUTATION
, 1997
"... The calculus with synchronous output and mixedguarded choices is strictly more expressive than the calculus with asynchronous output and no choice. As a corollary, Palamidessi recently proved that there is no fully compositional encoding from the former into the latter that preserves divergenc ..."
Abstract

Cited by 65 (2 self)
 Add to MetaCart
The calculus with synchronous output and mixedguarded choices is strictly more expressive than the calculus with asynchronous output and no choice. As a corollary, Palamidessi recently proved that there is no fully compositional encoding from the former into the latter that preserves divergencefreedom and symmetries. This paper shows
A Concurrent Logical Framework: The Propositional Fragment
, 2003
"... We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations di#ering only in the order of execution of independent steps. From a logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic. An encoding of a small Petri net exemplifies the representation methodology, which can be summarized as "concurrent computations as monadic expressions ".
Session Types as Intuitionistic Linear Propositions
"... Several type disciplines for πcalculi have been proposed in which linearity plays a key role, even if their precise relationship with pure linear logic is still not well understood. In this paper, we introduce a type system for the πcalculus that exactly corresponds to the standard sequent calculu ..."
Abstract

Cited by 30 (15 self)
 Add to MetaCart
Several type disciplines for πcalculi have been proposed in which linearity plays a key role, even if their precise relationship with pure linear logic is still not well understood. In this paper, we introduce a type system for the πcalculus that exactly corresponds to the standard sequent calculus proof system for dual intuitionistic linear logic. Our type system is based on a new interpretation of linear propositions as session types, and provides the first purely logical account of all (both shared and linear) features of session types. We show that our type discipline is useful from a programming perspective, and ensures session fidelity, absence of deadlocks, and a tight operational correspondence between πcalculus reductions and cut elimination steps. 1
A Concurrent Model for Linear Logic
"... We build a realizability model for linear logic using a namepassing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly con ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
We build a realizability model for linear logic using a namepassing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly concurrent behaviours. Then we study how embeddings of intuitionistic and classical logics into linear logic induce typed translations of λ and λµ calculi in which new concurrent instructions can be introduced, thus sketching the basis for a CurryHoward interpretation of linear and classical proofs in terms of concurrent interaction.
Solo Diagrams
 PROCEEDINGS OF TACS 2001
, 2001
"... We address the problems of implementing the
replication operator efficiently in the solos calculusa calculus of
mobile processes without prefix. This calculus is expressive enough to
admit an encoding of the whole fusion calculus and thus the
picalculus.
We show that nested occurrences of replic ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We address the problems of implementing the
replication operator efficiently in the solos calculusa calculus of
mobile processes without prefix. This calculus is expressive enough to
admit an encoding of the whole fusion calculus and thus the
picalculus.
We show that nested occurrences of replication can be avoided, that
the size of replicated terms can be limited to three particles, and
that the usual unfolding semantics of replication can be replaced by
three simple reduction rules. To illustrate the results and show how
the calculus can be efficiently implemented we present a graphic
representation of agents in the solos calculus, adapting ideas from
interaction diagrams and pinets.
Composition of semantic web services using linear logic theorem proving
 Information Systems
, 2005
"... This paper introduces a method for automatic composition of semantic web services using Linear Logic (LL) theorem proving. The method uses semantic web service language (DAMLS) for external presentation of web services, while, internally, the services are presented by extralogical axioms and proofs ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
This paper introduces a method for automatic composition of semantic web services using Linear Logic (LL) theorem proving. The method uses semantic web service language (DAMLS) for external presentation of web services, while, internally, the services are presented by extralogical axioms and proofs in LL. LL, as a resource conscious logic, enables us to define attributes of web services formally (including qualitative and quantitative values of nonfunctional attributes). The subtyping rules that are used for semantic reasoning are presented with LL inference figures. We propose a system architecture where the DAMLS Translator, LL Theorem Prover and Semantic Reasoner can operate together. This architecture has been implemented in Java.
Head Linear Reduction and Pure Proof Net Extraction
, 1994
"... ) Proof net calculus introduced in [Gir87] has been extended in the paradigm of the Scott's domains equation D = D ! D which generates a logical point of view for pure calculus in [Dan89]. Methodologically speaking: in this paper the proof theoretic counterpart of the Bohm's Theorem given ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
) Proof net calculus introduced in [Gir87] has been extended in the paradigm of the Scott's domains equation D = D ! D which generates a logical point of view for pure calculus in [Dan89]. Methodologically speaking: in this paper the proof theoretic counterpart of the Bohm's Theorem given in [Boh68] for pure calculus, is proposed as extention of the CurryHoward paradigm. Tecnicallly speaking: as the extraction of a subterm using the fireduction is possible also subnet extraction can be internalized by cutelimination: using proof nets helps us to understand more deeply, and to handle in a better way the procedure of extraction. Introduction Two main traditions of logic in computer science are: 1. The fixpoint theory tradition: a program is a solution of a fixpoint equation. 2. The proof theory tradition: a (functional) program satisfying a specification corresponds to a proof of a formula. Pure calculus appears somewhere in the middle of these two traditions. ffl models of pure...