The University of Southampton
University of Southampton Institutional Repository

# Computing Property-Preserving Behaviour Abstractions from Trace Reductions

Record type: Conference or Workshop Item (Other)

Weakly continuation-closed abstractions are known to preserve properties satisfied within fairness, i.e. linear-time temporal properties under an abstract notion of fairness. Being defined on the complete behaviour of a distributed system, weakly continuation-closed abstractions require, in principle, an exhaustive state-space construction prior to abstraction. Constructing the state-space of a practically relevant specification exhaustively, however, is usually unfeasible. Based on the notion of traces, i.e. certain equivalence classes of behaviours, we define trace reductions. Trace reductions are a particular partial-order reduction based on the persistent-set selective search technique. We show that a trace reduction can be used on behalf of the complete behaviour of a distributed system in order to compute abstractions as well as to check whether the abstractions are weakly continuation-closed. Thus, trace reductions allow us to overcome the requirement of an exhaustive state-space construction prior to abstraction.

Full text not available from this repository.

## Citation

James, Simon St and Ultes-Nitsche, Ulrich (2001) Computing Property-Preserving Behaviour Abstractions from Trace Reductions At Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (ACM PODC'2001). , pp. 238-245.

Published date: August 2001
Venue - Dates: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (ACM PODC'2001), 2001-08-01
Organisations: Electronics & Computer Science

## Identifiers

Local EPrints ID: 254463
URI: http://eprints.soton.ac.uk/id/eprint/254463
ISBN: 1-58113-383-9
PURE UUID: 1b0b4b2c-2d3a-4b21-9190-2e5c12ba9fea

## Catalogue record

Date deposited: 06 Nov 2001

## Contributors

Author: Simon St James
Author: Ulrich Ultes-Nitsche