Abstract
We present a specification of Lamport’s Bakery algorithm written in AsmL specification language. By exploration of the state space of the induced labeled transition system we show how to verify important safety and liveness properties of the algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
