Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.

Zapraszamy na https://bibliotekanauki.pl

Zapraszamy na https://bibliotekanauki.pl

325-331

wydano

2015-12-01

otrzymano

2015-08-14

online

2016-03-25

autor

- Taras Shevchenko National University, Kyiv, Ukraine

autor

- Taras Shevchenko National University, Kyiv, Ukraine

autor

- Ben-Gurion University, Beer-Sheva, Israel

- [1] Uri Abraham. Models for Concurrency. Gordon and Breach, 1999.
- [2] Uri Abraham, Ievgen Ivanov, and Mykola Nikitchenko. Proving behavioral properties of distributed algorithms using their compositional semantics. In Proceedings of the First International Seminar Specification and Verification of Hybrid Systems, October 10-12, 2011, Taras Shevchenko National University of Kyiv, pages 9–19, 2011.
- [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, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8 17.[Crossref]
- [4] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.
- [5] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.
- [6] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.
- [7] K. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley, 1988.
- [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, Information and Communication Technologies in Education, Research, and Industrial Applications, volume 469 of Communications in Computer and Information Science, pages 78–99. Springer International Publishing, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8 4.[Crossref]
- [9] L. Lamport. On interprocess communication. Part I: Basic formalism; Part II: Algorithms. Distributed Computing, 1:77–101, 1986.
- [10] Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990.
- [11] G. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12:1133–1145, 1981.
- [12] V. Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15:33–71, 1986.
- [13] M. Raynal. A simple taxonomy for distributed mutual exclusion algorithms. ACM SIGOPS Operating Systems Review, 25:47–50, 1991.
- [14] Tom Ridge. Peterson’s algorithm in Isabelle/HOL. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.3484, 2006.
- [15] Tom Ridge. Operational reasoning for concurrent Caml programs and weak memory models. In Klaus Schneider and Jens Brandt, editors, Theorem Proving in Higher Order Logics, volume 4732 of Lecture Notes in Computer Science, pages 278–293. Springer Berlin Heidelberg, 2007. ISBN 978-3-540-74590-7. doi:10.1007/978-3-540-74591-4 21.[Crossref]
- [16] Wojciech A. Trybulec and Grzegorz Bancerek. Kuratowski – Zorn lemma. Formalized Mathematics, 1(2):387–393, 1990.
- [17] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.
- [18] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990.
- [19] Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85–89, 1990.

bwmeta1.id-class.MML

PETERSON

bwmeta1.element.doi-10_1515_forma-2015-0026