scientific article; zbMATH DE number 1497812
From MaRDI portal
Publication:4499230
zbMath0967.68089MaRDI QIDQ4499230
Fabio Gadducci, Reiko Heckel, Mercè Llabrés
Publication date: 4 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Van Kampen Colimits as Bicolimits in Span ⋮ 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). ⋮ Calculating Colimits Compositionally ⋮ On the geometry and algebra of networks with state ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ GETGRATS ⋮ Categorical rewriting of term-like structures ⋮ Pure bigraphs: structure and dynamics ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ GS·Λ Theories ⋮ Normal forms for algebras of connections. ⋮ Adhesive DPO Parallelism for Monic Matches ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting ⋮ Bigraphs and Their Algebra ⋮ Dynamic connectors for concurrency
This page was built for publication: