Approximating the Behaviour of Graph Transformation Systems

@inproceedings{Baldan2002ApproximatingTB,
  title={Approximating the Behaviour of Graph Transformation Systems},
  author={Paolo Baldan and Barbara K{\"o}nig},
  booktitle={ICGT},
  year={2002}
}
We propose a technique for the analysis of graph transformation systems based on the construction of finite structures approximating the behaviour of such systems with arbitrary accuracy. Following a classical approach, one can construct a chain of finite under-approximations (k-truncations) of the Winskel’s style unfolding of a graph grammar. More interestingly, also a chain of finite overapproximations (k-coverings) of the unfolding can be constructed and both chains converge (in a… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 48 CITATIONS, ESTIMATED 44% COVERAGE

109 Citations

01020'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 109 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

Static analysis of distributed systems with mobility specified by graph grammars—a case study

  • P. Baldan, A. Corradini, B. König
  • In Proc. of IDPT ’02 (World Conference on…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…