Change search
ReferencesLink to record
Permanent link

Direct link
Proving liveness properties of concurrent programs using petri-nets
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

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 scalability and automation. We translate the formal proof to a petri-net representation and use this to verify basic algorithms. We show that the formal proof of liveness stated by Owiki and Lamport can be adapted to petri-nets. We also show a modification to petri-nets for increased granularity in loop modeling. This is used to clarify the translation of the original proof to our petri-net representation. With these results we discuss the usefulness of our approach and compare it to other methods of ensuring liveness.

Place, publisher, year, edition, pages
, UMNAD, 989
National Category
Engineering and Technology
URN: urn:nbn:se:umu:diva-92803OAI: diva2:743458
Educational program
Bachelor of Science Programme in Computing Science
Available from: 2014-09-04 Created: 2014-09-04 Last updated: 2014-09-04Bibliographically approved

Open Access in DiVA

fulltext(268 kB)99 downloads
File information
File name FULLTEXT01.pdfFile size 268 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 99 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 193 hits
ReferencesLink to record
Permanent link

Direct link