The safety and liveness properties of the network protocol based on TLA
We propose a definition of the class of all fairness properties of concurrent systems. In this work, we introduce to the fair transition system, and then discuss the relation among safety property, liveness property and fairness property in the temporal logic of actions. On the way, we give a recent...
Uloženo v:
| Vydáno v: | 2013 IET International Conference on Information and Communications Technologies : April 27-29, 2013, Beijing, China s. 218 - 222 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Stevenage, UK
IET
2013
The Institution of Engineering & Technology |
| Témata: | |
| ISBN: | 1849196532, 9781849196536 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | We propose a definition of the class of all fairness properties of concurrent systems. In this work, we introduce to the fair transition system, and then discuss the relation among safety property, liveness property and fairness property in the temporal logic of actions. On the way, we give a recent overview work on fairness in reactive and concurrent systems, and innovatively prove the relation among of the fairness. Furthermore, we consider a ring-based leader election protocol. Leader election is an important protocol in distributed computing. We have proven or verified that this protocol satisfies safety and liveness properties, and use the temporal logic of actions for formalization and specification. |
|---|---|
| Bibliografie: | ObjectType-Article-1 ObjectType-Feature-2 SourceType-Conference Papers & Proceedings-1 content type line 22 |
| ISBN: | 1849196532 9781849196536 |
| DOI: | 10.1049/cp.2013.0055 |

