Software specification by graph grammars

2005 ◽  
pp. 267-287 ◽  
Author(s):  
M. Nagl ◽  
G. Engels ◽  
R. Gall ◽  
W. Schäfer
Keyword(s):  
Graph Grammars ◽  
Software Specification

Software specification using graph grammars

Computing ◽  
1983 ◽  
Vol 31 (4) ◽  
pp. 317-346 ◽  
Author(s):  
G. Engels ◽  
R. Gall ◽  
M. Nagl ◽  
W. Schäfer
Keyword(s):  
Graph Grammars ◽  
Software Specification

Model-Checking of Infinite Graphs Defined by Graph Grammars

2000 ◽  
Vol 5 ◽  
pp. 1 ◽  
Author(s):  
O BURKART ◽  
Y QUEMENER
Keyword(s):  
Model Checking ◽  
Infinite Graphs ◽  
Graph Grammars

On the Expressiveness of Context-Sensitive Graph Grammars

2012 ◽  
Vol 23 (7) ◽  
pp. 1635-1655 ◽  
Author(s):  
Yang ZOU ◽  
Jian LÜ ◽  
Chun CAO ◽  
Hao HU ◽  
Wei SONG ◽  
...  
Keyword(s):  
Graph Grammars ◽  
Context Sensitive

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

2021 ◽  
Author(s):  
Nils Weidmann ◽  
Anthony Anjorin
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Experimental Evaluation ◽  
Graph Grammars ◽  
Model Driven Engineering ◽  
Rule Based ◽  
Consistency Management ◽  
Model Driven ◽  
Triple Graph Grammars ◽  
Domain Constraints

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Formal manipulation of Forrester diagrams by graph grammars

1988 ◽  
Vol 18 (6) ◽  
pp. 981-996 ◽  
Author(s):  
J.J. Dolado ◽  
F.J. Torrealdea
Keyword(s):  
Graph Grammars

A Church-Rosser theorem for graph grammars

1975 ◽  
Vol 7 (3) ◽  
pp. 26-31 ◽  
Author(s):  
Barry K. Rosen
Keyword(s):  
Graph Grammars

Extending Linear Temporal Logic with Clocks to Object-Z

2014 ◽  
Vol 513-517 ◽  
pp. 927-930
Author(s):  
Zhi Cheng Wen ◽  
Zhi Gang Chen
Keyword(s):  
Real Time ◽  
Temporal Logic ◽  
Formal Specification ◽  
Large Scale ◽  
Linear Temporal Logic ◽  
Specification Language ◽  
Continuous Variables ◽  
Real Time System ◽  
Software Specification ◽  
Formal Specification Language

Object-Z, an extension to formal specification language Z, is good for describing large scale Object-Oriented software specification. While Object-Z has found application in a number of areas, its utility is limited by its inability to specify continuous variables and real-time constraints. Linear temporal logic can describe real-time system, but it can not deal with time variables well and also can not describe formal specification modularly. This paper extends linear temporal logic with clocks (LTLC) and presents an approach to adding linear temporal logic with clocks to Object-Z. Extended Object-Z with LTLC, a modular formal specification language, is a minimum extension of the syntax and semantics of Object-Z. The main advantage of this extension lies in that it is convenient to describe and verify the complex real-time software specification.

Heterogeneous graph grammars synchronization in CAD systems supported by hypergraph representations of buildings

2014 ◽  
Vol 41 (4) ◽  
pp. 990-998 ◽  
Author(s):  
Leszek Kotulski ◽  
Adam Sędziwy ◽  
Barbara Strug
Keyword(s):  
Graph Grammars ◽  
Cad Systems

Converting metamodels to graph grammars: doing without advanced graph grammar features

2013 ◽  
Vol 14 (3) ◽  
pp. 1297-1317 ◽  
Author(s):  
Luka Fürst ◽  
Marjan Mernik ◽  
Viljan Mahnič
Keyword(s):  
Graph Grammar ◽  
Graph Grammars
Sign in / Sign up

Export Citation Format

Share Document