Specifying concurrent systems with Δ-grammars

Kaplan, Simon M.; Goering, Steven K.; Campbell, Roy H.

doi:10.1145/75200.75203

Cited by 5 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The research area of graph rewriting has a large mathematical backing [8,10,11,12]), while it remains fairly intuitive in use. We use the algebraic single-pushout approach towards conditional graph rewriting [13,14,15], where application conditions are used to determine when a certain production is applicable to a given graph.…”

Section: Graph Rewritingmentioning

confidence: 99%

“…Previous graph rewriting languages include GOOD [15], Progres [18], Dactl /MONSTR [7,1] and -grammar programming [11], each of which has a unique interpretation of programming with graph rewrites. These graph rewriting languages vary in several important aspects: the type of host graph that is to be rewritten may be any graph, or it may be restricted by disallowing duplicate nodes or arcs, or indeed may have some underlying hierarchical structure; the graph may be rewritten in a serial or parallel manner; the transformations may be initiated in a number of ways; the transformations may be applied in serial or parallel; and there are alternative ways that the user can specify the transformations.…”

Section: Programming With Graph Rewritesmentioning

confidence: 99%

See 1 more Smart Citation

Applications of Graph Transformations with Industrial Relevance

Agtive¹,

Nagl²,

Schürr³

et al. 2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

                                                                                                                                                                                                                                                                      ...

show abstract

Section: Graph Rewritingmentioning

confidence: 99%

Section: Programming With Graph Rewritesmentioning

confidence: 99%

Applications of Graph Transformations with Industrial Relevance

Agtive¹,

Nagl²,

Schürr³

et al. 2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Visual ∆-grammar programming [11] was introduced as a method of writing concurrent programs. The method of specifying the productions is via a single diagram, where the items to be removed and added are given by their position in relation to a triangular structure.…”

Section: Graph Rewriting Programming Languagesmentioning

confidence: 99%

A graph rewriting programming language for graph drawing

Rodgers

Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)

View full text Add to dashboard Cite

show abstract

An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems

2017

View full text Add to dashboard Cite

Abstract. This paper uses a case study to evaluate empirically three formalisms of different kinds for their suitability for the modelling and analysis of dynamic reconfiguration of dependable systems. The requirements on an ideal formalism for dynamic software reconfiguration are defined. The reconfiguration of an office workflow for order processing is described, and the requirements on the reconfiguration of the workflow are defined. The workflow is modelled using the Vienna Development Method (VDM), conditional partial order graphs (CPOGs), and the basic Calculus of Communicating Systems for dynamic process reconfiguration (basic CCS dp ), and verification of the reconfiguration requirements is attempted using the models. The formalisms are evaluated according to their ability to model the reconfiguration of the workflow, to verify the requirements on the workflow's reconfiguration, and to meet the requirements on an ideal formalism.

show abstract

Specifying concurrent systems with Δ-grammars

Cited by 5 publications

References 6 publications

Applications of Graph Transformations with Industrial Relevance

Applications of Graph Transformations with Industrial Relevance

A graph rewriting programming language for graph drawing

An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems

Contact Info

Product

Resources

About