### Abstract

Recently, a modern version of Roscoes and Brookes Failure-Divergence Semantics for CSP has been formalized in Isabelle: HOL-CSP. The session HOL-CSP introduces among other things some binary operators on processes that we will here generalize in a fully-abstract way. On these "architectural operators", we will prove the properties of refinement, the rules of continuity and the laws of interaction so that they can be easily used. Finally, we will give examples of their usefulness when trying to model complex systems.

### License

BSD License

### Topics

- Computer science/Concurrency/Process calculi
- Computer science/Semantics and reasoning

### Session HOL-CSPM

- Introduction
- PreliminaryWork
- Patch
- MultiDet
- MultiNdet
- MultiSync
- MultiSeq
- GlobalNdet
- CSPM
- DiningPhilosophers
- POTS
- EventsProperties
- DeadlockResults
- Conclusion

### Depends on

- HOL-CSP Version 2.0

### Used by

- Operational Semantics formally proven in HOL-CSP

### Auto-related entries

- Operational Semantics formally proven in HOL-CSP

## Cite

×

HOL-CSPM-AFP

    @article{HOL-CSPM-AFP,
      author  = {Benoît Ballenghien and Safouan Taha and Burkhart Wolff},
      title   = {HOL-CSPM - Architectural operators for HOL-CSP},
      journal = {Archive of Formal Proofs},
      month   = {December},
      year    = {2023},
      note    = {\url{https://isa-afp.org/entries/HOL-CSPM.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest