Proving liveness properties of concurrent programs using petri-nets
With the increased scale of distributed computations the complexity of liveness proofs have increased. In this paper we endeavor to simplify the process of verifying a concurrent system using well know modeling techniques. The choice of modeling tool as well as the proof is based on future scalabili...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Umeå universitet, Institutionen för datavetenskap
2014
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92803 |