The Most Abstract Common Refinement
Abstract
We introduce a novel binary operation on specifications. The most abstract common refinement (m.a.c.r.) of two specifications P1 and P2 is the most abstract specification that refines both P1 and P2. We define the m.a.c.r.s of omega-automata and of linear temporal formulae. The m.a.c.r. operation supports a two-dimensional system design process that combines structural decomposition with stepwise refinement. As an example, we design and verify a watch in several steps, each of which simultaneously integrates and refines two partial specifications of the watch.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 04, 1994
- Accession Number
- ADA278870
Entities
People
- Limor Fix
- Thomas Henzinger
Organizations
- Cornell University