A Single Complete Refinement Rule for Demonic Specifications

Authors:
Karl Lermer;Paul A. Strooper
Affiliations:
-;-
Venue:
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Year:
2000

Citing 8
Cited 0

Communicating sequential processes

Communicating sequential processes
Prespecification in data refinement

Information Processing Letters
Process simulation and refinement

Formal Aspects of Computing
Systematic software development using VDM (2nd ed.)

Systematic software development using VDM (2nd ed.)
Using Z: specification, refinement, and proof

Using Z: specification, refinement, and proof
Various Simulations and Refinements

Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Forward and Backward Simulations for Timing-Based Systems

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Data Refinement: Model-Oriented Proof Methods and their Comparison

Data Refinement: Model-Oriented Proof Methods and their Comparison

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the complete lattice of demonic languages and its interpretation in refinement proofs. In contrast to the conventional approach of refinement with an abstraction relation on the underlying state spaces, we introduce a notion of refinement with an abstraction relation on the power sets of the state spaces. This allows us to derive a single complete refinement rule for demonic specifications.