Checking Properties within Fairness and Behavior Abstraction
Ultes-Nitsche, Ulrich and Wolper, Pierre (2001) Checking Properties within Fairness and Behavior Abstraction. Submitted to ACM Transactions on Computational Logic (TOCL), 22 pages.
Full text not available from this repository.
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.
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science
|Date Deposited:||06 Nov 2001|
|Last Modified:||02 Mar 2012 13:41|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)