A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). (Q4917051): Difference between revisions
From MaRDI portal
Latest revision as of 09:22, 6 July 2024
scientific article; zbMATH DE number 6158646
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). |
scientific article; zbMATH DE number 6158646 |
Statements
A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). (English)
0 references
26 April 2013
0 references
concurrent graph rewriting
0 references
graphical encoding of process calculi
0 references
mobile ambients
0 references
reduction semantics
0 references
0 references
