Weakly Continuation-Closed Abstractions can be Defined on Trace Reductions

Ultes-Nitsche, Ulrich and James, Simon St (2000) Weakly Continuation-Closed Abstractions can be Defined on Trace Reductions. Leuschel, Michael, Podelski, Andreas, Ramakrishnan, C.R. and Ultes-Nitsche, Ulrich (eds.) Proceedings of the International Workshop on Verification and Computational Logic (VCL?2000). 11 pages .

Abstract

Weakly continuation-closed abstractions are known to preserve properties satisfied up to liveness, i.e. linear-time temporal properties under an abstract notion of fairness. Being defined on the complete behaviour of a concurrent 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. We show that a trace reduction can be used on behalf of the complete behaviour of a concurrent system in order to compute abstractions as well as to check whether the abstractions are weakly continuation-closed. So trace reductions allow us to overcome the requirement of an exhaustive state-space construction prior to abstraction.

This record has no associated files available for download.

Contributors

Download statistics