On CSP Refinement Tests That Run Multiple Copies of a Process
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying Stateful Timed CSP Using Implicit Clocks and Zone Abstraction
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Preserving security properties under refinement
Proceedings of the 7th International Workshop on Software Engineering for Secure Systems
WSCMon: runtime monitoring of web service orchestration based on refinement checking
Service Oriented Computing and Applications
More anti-chain based refinement checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
An analytical and experimental comparison of CSP extensions and tools
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Modeling and verifying hierarchical real-time systems using stateful timed CSP
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
We show that wide-ranging classes of predicates on the failures-divergences model for CSP can be represented by refinement checks in a general form. These are predicates of a process P expressible as F(P)⊏G(P), where F and G are CSP contexts and ⊏ is refinement. We use ideas similar to full abstraction, but achieve a stronger property than that. Our main result is that topologically-closed predicates are precisely those representable when F and G are both uniformly continuous. We show that sub-classes of predicates such as refinement-closed and distributive ones are represented by special forms of this check.