DocumentCode
2488721
Title
Fragmented retrenchment, concurrency and fairness
Author
Banach, R. ; Poppleton, M.
Author_Institution
Dept. of Comput. Sci., Manchester Univ., UK
fYear
2000
fDate
2000
Firstpage
143
Lastpage
151
Abstract
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and briefly justified. Fragmented retrenchment permits the granularity of actions to decrease across a development step, many concrete steps retrenching a single abstract one. This generates the usual proliferation of interleavings of events at the concrete level. Event structures, particularly flow event structures, help to control these within the retrenchments of a single abstract step, while the concurrent reading of the fragmented retrenchment proof obligation permits acceptable interleavings of retrenchments of different steps. It is observed that retrenchment allows the convenient description of unfair behaviours when fairness is not guaranteed
Keywords
concurrency theory; formal specification; refinement calculus; concurrency; fairness; flow event structures; fragmented retrenchment; refinement; relational framework; Concrete; Concurrent computing; Interleaved codes; Mathematics; State-space methods; Systems engineering and theory; Turning; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Formal Engineering Methods, 2000. ICFEM 2000. Third IEEE International Conference on
Conference_Location
York
Print_ISBN
0-7695-0822-7
Type
conf
DOI
10.1109/ICFEM.2000.873814
Filename
873814
Link To Document