DocumentCode :
2850181
Title :
A Semantic Preorder on Refinement and Fairness
Author :
Huang, X.W. ; Jiao, L. ; Lu, W.M.
Author_Institution :
Chinese Acad. of Sci., Beijing
fYear :
2007
fDate :
6-8 June 2007
Firstpage :
139
Lastpage :
148
Abstract :
We suggest a preorder notion for Stable Configuration Structures as a semantic model of concurrent systems. It combines the notions of observation-congruence-like fairness and the refinement operation for the specification and analysis of different levels of abstraction. We prove that our notion can be integrated into a lattice showing the interplay between the interleaving/causal semantics and the timing of choices between different executions.
Keywords :
concurrency theory; formal specification; program testing; programming language semantics; refinement calculus; Pomset fair testing preorder; abstraction level specification; concurrent systems; interleaving-causal semantics; observation-congruence-like fairness; refinement operation; semantic preorder; stable configuration structures; Computer science; Interleaved codes; Laboratories; Lattices; Mathematics; Observability; Proposals; Protocols; Testing; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Theoretical Aspects of Software Engineering, 2007. TASE '07. First Joint IEEE/IFIP Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-2856-4
Type :
conf
DOI :
10.1109/TASE.2007.5
Filename :
4239958
Link To Document :
بازگشت