A Rewriting Calculus for Multigraphs with Ports | Zendy

Oana Andrei | Zendy; Claude Kirchner | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Rewriting Calculus for Multigraphs with Ports

Author(s) -

Oana Andrei,

Claude Kirchner

Publication year - 2008

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.2008.10.035

Subject(s) - multigraph , rewriting , confluence , graph rewriting , encode , graph , mathematics , relation (database) , term (time) , computer science , discrete mathematics , programming language , biology , biochemistry , physics , quantum mechanics , database , gene

In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and a multigraph rewriting relation. Then we encode the multigraphs and multigraph rewriting using algebraic terms and term rewriting to provide an operational semantics of the multigraph rewriting relation. This term version can be embedded in the rewriting calculus, thus defining for labeled multigraph transformations a high-level pattern calculus, called ρmg-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