A Case Study: Verifying a Mutual Exclusion Protocol with Process Creation using Graph Transformation Systems
We 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.
Dieser Eintrag ist freigegeben.