%E Cosimo Laneve
%E Jianwen Su
%D 2009
%A Roberto Bruni
%A Fabio Gadducci
%A Alberto Lluch-Lafuente
%L eprints147
%I Springer
%X 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.
%B Web Services and Formal Methods (WS-FM?09)
%V 6194
%S Lecture Notes in Computer Science
%P 46-60
%T A Graph Syntax for Processes and Services
%R 10.1007/978-3-642-14458-5_3