A Logic for Analyzing Abstractions of Graph Transformation Systems

@inproceedings{Baldan2003ALF,
  title={A Logic for Analyzing Abstractions of Graph Transformation Systems},
  author={Paolo Baldan and Barbara K{\"o}nig and Bernhard K{\"o}nig},
  booktitle={SAS},
  year={2003}
}
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri net-like structures has been recently defined in the literature. In this paper we introduce a monadic second-order logic over graphs expressive enough to characterise typical graph properties, and we show how its formulae can be effectively verified. More specifically, we provide an encoding of such graph formulae into quantifier-free formulae over Petri net markings and we characterise, via a… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS, ESTIMATED 36% COVERAGE

81 Citations

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

See our FAQ for additional information.

Similar Papers

Loading similar papers…