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.
Citation:
X.W. Huang, L. Jiao, W.M. Lu, "A Semantic Preorder on Refinement and Fairness," tase, pp.139-148, First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07), 2007