We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Fair testing and stubborn sets.
- Authors
Valmari, Antti; Vogler, Walter
- Abstract
Partial order methods alleviate state explosion by considering only a subset of actions in each constructed state. The choice of the subset depends on the properties that the method promises to preserve. Many methods have been developed ranging from deadlock-preserving to CTL∗<inline-graphic></inline-graphic>-preserving and divergence-sensitive branching bisimilarity preserving. The less the method preserves, the smaller state spaces it constructs. Fair testing equivalence unifies deadlocks with livelocks that cannot be exited and ignores the other livelocks. It is the weakest congruence that preserves whether or not the system may enter a livelock that it cannot leave. We prove that a method that was designed for trace equivalence also preserves fair testing equivalence. We demonstrate its effectiveness on a protocol with a connection and data transfer phase. This is the first practical partial order method that deals with a practical fairness assumption.
- Subjects
FAIRNESS; DIVERGENCE theorem; APPLICATION software; DATA structures; ELECTRONIC linearization
- Publication
International Journal on Software Tools for Technology Transfer, 2018, Vol 20, Issue 5, p589
- ISSN
1433-2779
- Publication type
Article
- DOI
10.1007/s10009-017-0481-2