Rules for abstraction
The paper aims at a logical reconstruction of the principle of homomorphic abstraction, the investigation being performed from both theoretical and practical points of view. The TLA is used mainly because its distinction between the transition and temporal levels of description offers an adequate framework for combining interactive theorem proving and model checking. The contribution of the paper is twofold: to re-examine the principles underlying abstraction techniques by stating a series of proof rules in Lamport's TLA and to generalize known abstraction techniques using the standard laws of temporal logic. A brief overview of TLA and the main proof rules for abstraction and an illustrative example are given in the first four sections of the paper. Section five discusses techniques to obtain better abstractions, followed by comments. A comparative analysis with already existing work is supplied in the final part of the paper. For the entire collection see [Zbl 0878.00079].
This page was built for publication: Rules for abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370347)