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. Proceedings of the International Workshop on Verification and Computational Logic (VCL�2000) University of Southampton, 11 pages.
Full text not available from this repository.
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.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science
|Date Deposited:||25 Oct 2000|
|Last Modified:||02 Mar 2012 11:57|
|Contributors:||Ultes-Nitsche, Ulrich (Author)
James, Simon St (Author)
Leuschel, Michael (Editor)
Podelski, Andreas (Editor)
Ramakrishnan, C.R. (Editor)
Ultes-Nitsche, Ulrich (Editor)
|Publisher:||University of Southampton|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)