scientific article; zbMATH DE number 1497812
From MaRDI portal
Publication:4499230
Recommendations
Cited in
(25)- Synthesising CCS bisimulation using graph rewriting
- Dynamic connectors for concurrency
- Normal forms for algebras of connections.
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Concurrency theorems for non-linear rewriting theories
- A generalized concurrent rule construction for double-pushout rewriting
- Pure bigraphs: structure and dynamics
- GS theories: a syntax for higher-order graphs
- Adhesive DPO parallelism for monic matches
- Modeling pointer redirection as cyclic term-graph rewriting
- Bigraphs and their algebra
- Van Kampen colimits as bicolimits in Span
- Calculating Colimits Compositionally
- 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).
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Categorical rewriting of term-like structures
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- On the geometry and algebra of networks with state
- Foundations of Software Science and Computation Structures
- Formal Methods in Software and Systems Modeling
- Formal Methods in Software and Systems Modeling
- Concurrent Rewriting for Graphs with Equivalences
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Graph Rewriting Components
- A taxonomy of categories for relations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4499230)
