Skip to main content
Have a personal or library account? Click to login
Event-Based Proof of the Mutual Exclusion Property of Peterson’s Algorithm Cover

Event-Based Proof of the Mutual Exclusion Property of Peterson’s Algorithm

Open Access
|Mar 2016

References

  1. [1] Uri Abraham.. Gordon and Breach, 1999.
  2. [2] Uri Abraham, Ievgen Ivanov, and Mykola Nikitchenko. Proving behavioral properties of distributed algorithms using their compositional semantics. In, pages 9–19, 2011.
  3. [3] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors,, volume 9150 of, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8 17.
  4. [4] Czesław Byliński. Functions and their basic properties., 1(): 55–65, 1990.
  5. [5] Czesław Byliński. Functions from a set to a set., 1():153–164, 1990.
  6. [6] Czesław Byliński. Some basic properties of sets., 1():47–53, 1990.
  7. [7] K. Chandy and J. Misra.. Addison Wesley, 1988.
  8. [8] Ievgen Ivanov, Mykola Nikitchenko, and Uri Abraham. On a decidable formal theory for abstract continuous-time dynamical systems. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors,, volume 469 of, pages 78–99. Springer International Publishing, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8 4.
  9. [9] L. Lamport. On interprocess communication. Part I: Basic formalism; Part II: Algorithms., 1:77–101, 1986.
  10. [10] Beata Padlewska. Families of sets., 1():147–152, 1990.
  11. [11] G. Peterson. Myths about the mutual exclusion problem., 12:1133–1145, 1981.
  12. [12] V. Pratt. Modeling concurrency with partial orders., 15:33–71, 1986.
  13. [13] M. Raynal. A simple taxonomy for distributed mutual exclusion algorithms., 25:47–50, 1991.
  14. [14] Tom Ridge. Peterson’s algorithm in Isabelle/HOL., 2006.
  15. [15] Tom Ridge. Operational reasoning for concurrent Caml programs and weak memory models. In Klaus Schneider and Jens Brandt, editors,, volume 4732 of, pages 278–293. Springer Berlin Heidelberg, 2007. ISBN 978-3-540-74590-7. doi:10.1007/978-3-540-74591-4 21.
  16. [16] Wojciech A. Trybulec and Grzegorz Bancerek. Kuratowski – Zorn lemma., 1():387–393, 1990.
  17. [17] Zinaida Trybulec. Properties of subsets., 1():67–71, 1990.
  18. [18] Edmund Woronowicz. Relations and their basic properties., 1 ():73–83, 1990.
  19. [19] Edmund Woronowicz and Anna Zalewska. Properties of binary relations., 1():85–89, 1990.
DOI: https://doi.org/10.1515/forma-2015-0026 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Language: English
Page range: 325 - 331
Submitted on: Aug 14, 2015
Published on: Mar 25, 2016
Published by: University of Białystok
In partnership with: Paradigm Publishing Services

© 2016 Ievgen Ivanov, Mykola Nikitchenko, Uri Abraham, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.