Checking Properties within Fairness and Behavior Abstractions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Logic in Computer Science, D.2.4; F.3.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30513

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0101017
 http://arxiv.org/abs/cs/0101017

Collections

arXiv