Dotti, Fernando LuisKönig, BarbaraSantos, Osmar Marchi dosRibeiro, Leila2005-04-132016-03-312005-04-132016-03-312004117300691http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-22387http://elib.uni-stuttgart.de/handle/11682/2564http://dx.doi.org/10.18419/opus-2547We verify a mutual exclusion protocol with dynamic process creation based on token passing. The protocol is specified using object-based graph grammars. We introduce the protocol and show how the mutual exclusion property and other properties can be verified using the tool Augur, a verification tool for graph transformation systems based on an approximated unfolding technique.eninfo:eu-repo/semantics/openAccessGraphersetzungssystem , Programmverifikation004protocol verification , graph transformation systems , mutual exclusionA case study : verifying a mutual exclusion protocol with process creation using graph transformation systemsworkingPaper2013-07-08