Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets

Reference : Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/5608

Title :	Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets
Language :	English
Author, co-author :	Hermann, Frank [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Corradini, Andrea [> >]
	Ehrig, Hartmut [> >]
	König, Barbara [> >]
Publication date :	2010
Journal title :	Electronic Communications of the EASST
Publisher :	European Association of Software Science and Technology
Volume :	29
Special issue title :	Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'10)
Pages :	1--15
Peer reviewed :	Yes (verified by ORBi^lu)
ISSN :	1863-2122
Keywords :	[en] model transformation ; graph transformation ; model refactoring
Permalink :	http://hdl.handle.net/10993/5608
Other URL :	http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/39

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	415-1178-1-PB.pdf		Publisher postprint	1 MB	View/Open

All documents in ORBi^lu are protected by a user license.