Nondeterministic control structures for graph rewriting systems
From MaRDI portal
Recommendations
Cited in
(14)- UML packages for PROgrammed Graph REwriting Systems
- Widening with Thresholds for Programs with Complex Control Graphs
- scientific article; zbMATH DE number 3972181 (Why is no real title available?)
- scientific article; zbMATH DE number 4090811 (Why is no real title available?)
- Graph-based reengineering of telecommunication systems
- On the interleaving semantics of transformation units -- a step into GRACE
- Programmed graph transformations and graph transformation units in GRACE
- scientific article; zbMATH DE number 194600 (Why is no real title available?)
- Syntax and semantics of hybrid database languages
- Uniform-modelling in graph grammar specifications
- Logic based structure rewriting systems
- Efficient computation of arbitrary control dependencies
- Using programmed graph rewriting for the formal specification of a configuration management system
- A foundation for functional graph programs: the \textit{graph transformation control algebra} (GTA)
This page was built for publication: Nondeterministic control structures for graph rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694717)