Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900): Difference between revisions

@@ Property / DOI @@
-.1515/forma-2015-0026
@@ Property / DOI: 10.1515/forma-2015-0026 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4256353
@@ Property / cites work: Q4256353 / rank @@
+Normal rank
@@ Property / cites work @@
+Mizar: State-of-the-art and Beyond
@@ Property / cites work: Mizar: State-of-the-art and Beyond / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692502
@@ Property / cites work: Q4692502 / rank @@
+Normal rank
@@ Property / cites work @@
+On interprocess communication. I: Basic formalism
@@ Property / cites work: On interprocess communication. I: Basic formalism / rank @@
+Normal rank
@@ Property / cites work @@
+Myths about the mutual exclusion problem
@@ Property / cites work: Myths about the mutual exclusion problem / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling concurrency with partial orders
@@ Property / cites work: Modeling concurrency with partial orders / rank @@
+Normal rank
@@ Property / cites work @@
+Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
+Normal rank
@@ Property / cites work @@
+Q5203581
@@ Property / cites work: Q5203581 / rank @@
+Normal rank
@@ Property / DOI @@
+.1515/FORMA-2015-0026
@@ Property / DOI: 10.1515/FORMA-2015-0026 / rank @@
+Normal rank