Parallelism and concurrency of graph manipulations
From MaRDI portal
Cites work
- Contribution to the theory of concurrency in databases
- Deriving graphs from graphs by applying a production
- Dynamics of discrete systems and pattern reproduction
- Grammars on partial graphs
- Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
- scientific article; zbMATH DE number 3479108 (Why is no real title available?)
- scientific article; zbMATH DE number 3532853 (Why is no real title available?)
- scientific article; zbMATH DE number 3548465 (Why is no real title available?)
- scientific article; zbMATH DE number 3550175 (Why is no real title available?)
- scientific article; zbMATH DE number 3555491 (Why is no real title available?)
- scientific article; zbMATH DE number 3556036 (Why is no real title available?)
- scientific article; zbMATH DE number 3589736 (Why is no real title available?)
- scientific article; zbMATH DE number 3591400 (Why is no real title available?)
- scientific article; zbMATH DE number 3604374 (Why is no real title available?)
- scientific article; zbMATH DE number 3617563 (Why is no real title available?)
- scientific article; zbMATH DE number 3624769 (Why is no real title available?)
- scientific article; zbMATH DE number 3631954 (Why is no real title available?)
- scientific article; zbMATH DE number 3633738 (Why is no real title available?)
- scientific article; zbMATH DE number 3366845 (Why is no real title available?)
- Relational production systems
Cited in
(17)- Graph grammars and operational semantics
- Foundations of rule-based design of modular systems
- Parallel high-level replacement systems
- Amalgamation of graph transformations: a synchronization mechanism
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- A generalized concurrent rule construction for double-pushout rewriting
- Accretive computation of global transformations
- Reachability in graph transformation systems and slice languages
- Parallelism and concurrency in high-level replacement systems
- The category of typed graph grammars and its adjunctions with categories of derivations
- Patch graph rewriting
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Relational graph rewritings
- Parallel and distributed derivations in the single-pushout approach
- Categorical principles, techniques and results for high-level-replacement systems in computer science
- Superfluous arcs and confluent reductions in the minimum feedback vertex set problem
- On the confluence of directed graph reductions preserving feedback vertex set minimality
This page was built for publication: Parallelism and concurrency of graph manipulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147520)
