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...

Full description

Saved in:
Bibliographic Details
Published in:2013 IET International Conference on Information and Communications Technologies : April 27-29, 2013, Beijing, China pp. 218 - 222
Main Authors: Zhang, Junming, Long, Shigong, Wang, Kouwu
Format: Conference Proceeding
Language:English
Published: Stevenage, UK IET 2013
The Institution of Engineering & Technology
Subjects:
Formal logic
Formal methods
Parallel programming and algorithm theory
Parallel software
Protocols
network protocol
temporal specification
distributed processing
temporal logic
liveness property
formal specification
TLA-based protocol
distributed computing
formal verification
model checking
fairness property
concurrent systems
temporal logic of actions
safety property
protocols
ring-based leader election protocol
ISBN:1849196532, 9781849196536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
ObjectType-Feature-2
SourceType-Conference Papers & Proceedings-1
content type line 22
ISBN:1849196532
9781849196536
DOI:10.1049/cp.2013.0055