{"year":"1995","author":[{"first_name":"Reiko","last_name":"Heckel","full_name":"Heckel, Reiko"}],"user_id":"52534","date_created":"2019-02-20T14:01:39Z","_id":"7833","status":"public","department":[{"_id":"66"}],"publisher":"Universitat de les Illes Balears","type":"conference","citation":{"apa":"Heckel, R. (1995). Embedding of Conditional Graph Transformations. In <i>Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science</i>. Universitat de les Illes Balears.","chicago":"Heckel, Reiko. “Embedding of Conditional Graph Transformations.” In <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>. Technical Report. Universitat de les Illes Balears, 1995.","mla":"Heckel, Reiko. “Embedding of Conditional Graph Transformations.” <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>, no. B-19, Universitat de les Illes Balears, 1995.","ama":"Heckel R. Embedding of Conditional Graph Transformations. In: <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>. Technical Report. Universitat de les Illes Balears; 1995.","ieee":"R. Heckel, “Embedding of Conditional Graph Transformations,” in <i>Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science</i>, 1995, no. B-19.","bibtex":"@inproceedings{Heckel_1995, series={Technical Report}, title={Embedding of Conditional Graph Transformations}, number={B-19}, booktitle={Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}, publisher={Universitat de les Illes Balears}, author={Heckel, Reiko}, year={1995}, collection={Technical Report} }","short":"R. Heckel, in: Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science, Universitat de les Illes Balears, 1995."},"date_updated":"2022-01-06T07:03:46Z","language":[{"iso":"eng"}],"issue":"B-19","series_title":"Technical Report","publication":"Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science","abstract":[{"lang":"eng","text":"Single pushout graph transformations at injective matches are extended by negative application conditions. It is shown, how right-sided application conditions can be transformed into equivalent left-sided ones. Based on this result, conditional derived rules are introduced and a theorem, similiar to the double pushout embedding theorem is shown. Finally, three variants of contextual application conditions are discussed with respect to their expressive power and expected results."}],"title":"Embedding of Conditional Graph Transformations"}