Event-based proof of the mutual exclusion property of Peterson's algorithm
type: Item
instance of: scholarly article
title: Event-based proof of the mutual exclusion property of Peterson's algorithm
zbMATH Open document ID: 1334.68030
author: Ievgen Ivanov
author: M. S. Nikitchenko
author: Uri Abraham
published in: Formalized Mathematics
publication date: 2016-04-20T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 6570928
zbMATH Keywords: distributed system
zbMATH Keywords: parallel computing
zbMATH Keywords: algorithm
zbMATH Keywords: verification
zbMATH Keywords: mathematical model
describes a project that uses: Isabelle/HOL
describes a project that uses: Mizar
describes a project that uses: UNITY
MaRDI profile type: Publication
full work available at URL: forma-2015-0026
OpenAlex ID: W2313864317
cites work: Q4256353
cites work: Mizar: State-of-the-art and Beyond
cites work: Q4692502
cites work: On interprocess communication. I: Basic formalism
cites work: Myths about the mutual exclusion problem
cites work: Modeling concurrency with partial orders
cites work: Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
cites work: Q5203581
DOI: 10.1515/FORMA-2015-0026
description: scientific article; zbMATH DE number 6570928