Zobrazeno 1 - 10
of 307
pro vyhledávání: '"Lamport's bakery algorithm"'
Autor:
Hesselink, Wim H.
Publikováno v:
In Science of Computer Programming 1 September 2013 78(9):1622-1638
Publikováno v:
Jurnal Info Sains : Informatika dan Sains. 11:1-4
Mutual exclusion is one of the mechanisms that can be used to solve concurrency problems in the operating system. In the operating system, there are resources that cannot be shared at the same time, such as printers. These kinds of resources are call
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::251cf4e44ac70906c6943acddb642de5
https://doi.org/10.54209/infosains.v11i2.40
https://doi.org/10.54209/infosains.v11i2.40
Autor:
Wim H. Hesselink
Publikováno v:
Science of computer programming, 78(9), 1622-1638. ELSEVIER SCIENCE BV
Proof assistants like PVS can be used fruitfully for the design and verification of concurrent algorithms. The technique is presented here by applying it to Lamport's Bakery algorithm. The proofs for safety properties such as mutual exclusion, first-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d42babd28751e46856ef9c9af8dd53f
https://doi.org/10.1016/j.scico.2013.03.003
https://doi.org/10.1016/j.scico.2013.03.003
Autor:
Botinčan, Matko
Publikováno v:
Journal of Computing & Information Technology; Dec2005, Vol. 13 Issue 4, p313-319, 7p
Autor:
Matko Botinčan
Publikováno v:
Journal of computing and information technology
Volume 13
Issue 4
Volume 13
Issue 4
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 algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b00a7f55b6e02f3c1c166892043dbfa2
https://hrcak.srce.hr/file/69310
https://hrcak.srce.hr/file/69310
Autor:
Dariusz Wawrzyniak, Jerzy Brzeziński
Publikováno v:
PDP
As is well known Lamport's Bakery algorithm for mutual exclusion of n processes is correct if a physically shared memory is used as the communication facility between processes. An application of weaker consistency models (e.g. causal, processor, PRA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdbccaadaeebe70616573cc7d92cabd6
https://doi.org/10.1109/empdp.2000.823415
https://doi.org/10.1109/empdp.2000.823415
Publikováno v:
SOFSEM 2001: Theory and Practice of Informatics ISBN: 9783540429128
SOFSEM
SOFSEM
Lamport's Bakery algorithm is among the best known mutual exclusion algorithms. A drawback of Lamport's algorithm is that it requires unbounded registers for communication among processes. By making a small modification to Lamport's algorithm, we rem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd7131c36db5f798f9511cf123a77369
https://doi.org/10.1007/3-540-45627-9_23
https://doi.org/10.1007/3-540-45627-9_23
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.