Bruni, Roberto and Gadducci, Fabio and Lluch-Lafuente, Alberto A Graph Syntax for Processes and Services. In: Web Services and Formal Methods (WS-FM’09). Lecture Notes in Computer Science, 6194 . Springer, pp. 46-60. ISBN 978-3-642-14457-8 (2009)Full text not available from this repository.
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 are mapped 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 workflow language and a service-oriented calculus.
|Item Type:||Book Section|
|Funders:||Research supported by the EU FET integrated project Sensoria, IST-2005-016004.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 30 not found.|
|Date Deposited:||18 May 2011 10:31|
|Last Modified:||11 Jul 2011 14:34|
Actions (login required)