Search

Your search keyword '"workflow language"' showing total 4 results
Start Over Descriptor "workflow language" Publisher springer berlin heidelberg
4 results on '"workflow language"'

2. Executing Distributed Applications on Virtualized Infrastructures Specified with the VXDL Language and Managed by the HIPerNET Framework

Author

Koslovski, Guilherme, Huu, Tram Truong, Montagnat, Johan, Primet, Pascale Vicat-Blanc, Akan, Ozgur, editor, Bellavista, Paolo, editor, Cao, Jiannong, editor, Dressler, Falko, editor, Ferrari, Domenico, editor, Gerla, Mario, editor, Kobayashi, Hisashi, editor, Palazzo, Sergio, editor, Sahni, Sartaj, editor, Shen, Xuemin, editor, Stan, Mircea, editor, Xiaohua, Jia, editor, Zomaya, Albert, editor, Coulson, Geoffrey, editor, Avresky, Dimiter R., editor, Diaz, Michel, editor, Bode, Arndt, editor, Ciciani, Bruno, editor, and Dekel, Eliezer, editor

Published
2010
Full Text
View/download PDF

3. Workflow Pattern Analysis in Web Services Orchestration: The BPEL4WS Example

Author

Moscato, Francesco, Mazzocca, Nicola, Vittorini, Valeria, Di Lorenzo, Giusy, Mosca, Paola, Magaldi, Massimo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Yang, Laurence T., editor, Rana, Omer F., editor, Di Martino, Beniamino, editor, and Dongarra, Jack, editor

Published
2005
Full Text
View/download PDF

4. A Graph Syntax for Processes and Services

Author

Fabio Gadducci, Roberto Bruni, and Alberto Lluch Lafuente

Subjects
Theoretical computer science, Computer science, Process calculus, Intermediate representations, Visual representations, computer.software_genre, Graph isomorphism, Process calculi, Name restriction, Abstract syntax, Service Oriented, Syntax error, Parallel composition, Equivalence class, Structural induction, Soundness, Graph rewriting, Hierarchical features, Programming language, Soundness and completeness, Structured specification, Homoiconicity, Hierarchical graphs, Encodings, Isomorphic graphs, Workflow language, Syntax, Graph, Abstract semantic graph, Modular decomposition, Computer Science::Programming Languages, Abstract syntax tree, computer, Graph product
Abstract

We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient way to describe configurations in languages with inherently hierarchical features such as sessions, fault-handling scopes or transactions. The graph syntax can be seen as an intermediate representation language, that facilitates the encoding of structured specifications and, in particular, of process calculi, since it provides primitives for nesting, name restriction and parallel composition. The syntax is based on an algebraic presentation that faithfully characterises families of hierarchical graphs, meaning that each term of the language uniquely identifies an equivalence class of graphs (modulo graph isomorphism). Proving soundness and completeness of an encoding (i.e. proving that structurally equivalent processes aremapped to isomorphic graphs) is then facilitated and can be done by structural induction. Summing up, the graph syntax facilitates the definition of faithful encodings, yet allowing a precise visual representation. We illustrate our work with an application to a work-flow language and a service-oriented calculus.

Published
2010

Catalog

Books, media, physical & digital resources
See catalog results