The University of Southampton
University of Southampton Institutional Repository

Checking Properties within Fairness and Behavior Abstraction

Checking Properties within Fairness and Behavior Abstraction
Checking Properties within Fairness and Behavior Abstraction
This paper is motivated by the fact that verifying liveness properties under a fairness condition is often problematic, especially when abstraction is used. It shows that using a more abstract notion than truth under fairness, specifically the concept of a property being satisfied within fairness can lead to interesting possibilities. Technically, it is first established that deciding satisfaction within fairness is a PSPACE-complete problem and it is shown that properties satisfied within fairness can always be satisfied by some fair implementation. Thereafter, the interaction between behavior abstraction and satisfaction within fairness is studied and it is proved that satisfaction of properties within fairness can be verified on behavior abstractions, if the abstraction homomorphism is weakly continuation-closed.
22 pages
Ultes-Nitsche, Ulrich
bfc7f0a6-3cbb-40af-9935-6dce3a88a10b
Wolper, Pierre
c9ac0e4f-c07c-4f6b-82a6-0d294b9d8108
Ultes-Nitsche, Ulrich
bfc7f0a6-3cbb-40af-9935-6dce3a88a10b
Wolper, Pierre
c9ac0e4f-c07c-4f6b-82a6-0d294b9d8108

Ultes-Nitsche, Ulrich and Wolper, Pierre (2001) Checking Properties within Fairness and Behavior Abstraction. ACM Transactions on Computational Logic, 22 pages.

Record type: Article

Abstract

This paper is motivated by the fact that verifying liveness properties under a fairness condition is often problematic, especially when abstraction is used. It shows that using a more abstract notion than truth under fairness, specifically the concept of a property being satisfied within fairness can lead to interesting possibilities. Technically, it is first established that deciding satisfaction within fairness is a PSPACE-complete problem and it is shown that properties satisfied within fairness can always be satisfied by some fair implementation. Thereafter, the interaction between behavior abstraction and satisfaction within fairness is studied and it is proved that satisfaction of properties within fairness can be verified on behavior abstractions, if the abstraction homomorphism is weakly continuation-closed.

This record has no associated files available for download.

More information

Published date: 2001
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 254206
URI: http://eprints.soton.ac.uk/id/eprint/254206
PURE UUID: 15d6c76a-5246-426c-a27c-c2577718971e

Catalogue record

Date deposited: 06 Nov 2001
Last modified: 10 Dec 2021 20:37

Export record

Contributors

Author: Ulrich Ultes-Nitsche
Author: Pierre Wolper

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×