Article

Graph Grammar Engineering with PROGRES

Authors:

Andy Schürr,

Andreas J. Winter,

Albert ZündorfAuthors Info & Claims

Proceedings of the 5th European Software Engineering Conference

Pages 219 - 234

Published: 25 September 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Jukšs MVerbrugge CElaasar MVangheluwe H(2018)Scope in model transformationsSoftware and Systems Modeling (SoSyM)10.1007/s10270-016-0555-817:4(1227-1252)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10270-016-0555-8
Grabska EŚlusarczyk GGajek S(2013)Knowledge Representation for Human-Computer Interaction in a System Supporting Conceptual DesignFundamenta Informaticae10.5555/2594895.2594901124:1-2(91-110)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2594895.2594901
Karsai G(2010)Lessons learned from building a graph transformation systemGraph transformations and model-driven engineering10.5555/1985522.1985533(202-223)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1985522.1985533
Show More Cited By

Graph Grammar Engineering with PROGRES
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Parallel Communicating Graph Grammar
BIC-TA '11: Proceedings of the 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications

In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). ...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
A Context-Sensitive NCE Graph Grammar and its Parsability
VL '00: Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)

A context-sensitive graph grammar with neighborhood controlled embedding (context-sensitive NCE graph grammar) is an extension of the well-known (context-free) NCE graph grammar, and is flexible enough for use in formalizing the graph-syntax rules of a ...

Comments

Information & Contributors

Information

Published In

Proceedings of the 5th European Software Engineering Conference

September 1995

519 pages

ISBN:3540604065

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 25 September 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jukšs MVerbrugge CElaasar MVangheluwe H(2018)Scope in model transformationsSoftware and Systems Modeling (SoSyM)10.1007/s10270-016-0555-817:4(1227-1252)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10270-016-0555-8
Grabska EŚlusarczyk GGajek S(2013)Knowledge Representation for Human-Computer Interaction in a System Supporting Conceptual DesignFundamenta Informaticae10.5555/2594895.2594901124:1-2(91-110)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2594895.2594901
Karsai G(2010)Lessons learned from building a graph transformation systemGraph transformations and model-driven engineering10.5555/1985522.1985533(202-223)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1985522.1985533
Ng KHaron Z(2010)Visual microcontroller programming using extended S-system Petri netsWSEAS Transactions on Computers10.5555/1852437.18524409:6(573-582)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.5555/1852437.1852440
Mun NHaron Z(2010)Graphical microcontroller programming tool based on extended S-System Petri netProceedings of the 4th WSEAS international conference on Computer engineering and applications10.5555/1808102.1808131(159-163)Online publication date: 27-Jan-2010
https://dl.acm.org/doi/10.5555/1808102.1808131
Balasubramanian DNarayanan ANeema SNess BShi FThibodeaux RKarsai G(2008)Applying a Grouping Operator in Model TransformationsApplications of Graph Transformations with Industrial Relevance10.1007/978-3-540-89020-1_28(410-425)Online publication date: 15-Oct-2008
https://dl.acm.org/doi/10.1007/978-3-540-89020-1_28
Syriani EVangheluwe H(2008)Programmed Graph Rewriting with DEVSApplications of Graph Transformations with Industrial Relevance10.1007/978-3-540-89020-1_11(136-151)Online publication date: 15-Oct-2008
https://dl.acm.org/doi/10.1007/978-3-540-89020-1_11
Costagliola GDeufemia VFerrucci FGravino C(2006)Constructing Meta-CASE Workbenches by Exploiting Visual Language GeneratorsIEEE Transactions on Software Engineering10.1109/TSE.2006.2332:3(156-175)Online publication date: 1-Mar-2006
https://dl.acm.org/doi/10.1109/TSE.2006.23
Szuba J(2005)New Object-Oriented PROGRES for Specifying the Conceptual Design Tool GraCADElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2004.12.032127:1(141-156)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1016/j.entcs.2004.12.032
Grunske LGeiger LLawley M(2005)A graphical specification of model transformations with triple graph grammarsProceedings of the First European conference on Model Driven Architecture: foundations and Applications10.1007/11581741_21(284-298)Online publication date: 7-Nov-2005
https://dl.acm.org/doi/10.1007/11581741_21
Show More Cited By

Abstract

Cited By

Recommendations

Parallel Communicating Graph Grammar

Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

A Context-Sensitive NCE Graph Grammar and its Parsability

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations