A Translation from Object-Based Hypergraph Grammars into π-Calculus | Zendy

Luciana Foss | Zendy; Leila Ribeiro | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Translation from Object-Based Hypergraph Grammars into π-Calculus

Author(s) -

Luciana Foss,

Leila Ribeiro

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.04.015

Subject(s) - rule based machine translation , formalism (music) , computer science , hypergraph , tree adjoining grammar , l attributed grammar , programming language , theoretical computer science , graph , artificial intelligence , mathematics , context free grammar , discrete mathematics , art , musical , visual arts

Object-based models offer abstract constructions to describe complex systems. The Object-Based Graph Grammar (OBGG) is a formalism that may be used to describe this kind of system. This formalism is very intuitive, however, up to now, there are no automatic tools for verification of OBGGs. In this work we propose a translation from Object-Based Hypergraph Grammars into π-Calculus. So, we may be able to prove properties of the systems modeled in this kind of graph grammars through this translation and automatic checkers for π-calculus

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research