Unifying concurrent and relational refinement
From MaRDI portal
Publication:2844822
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(22)- Modelling Divergence in Relational Concurrent Refinement
- scientific article; zbMATH DE number 2013580 (Why is no real title available?)
- scientific article; zbMATH DE number 1951183 (Why is no real title available?)
- Simulation refinement for concurrency verification
- Relational concurrent refinement
- Verifying data refinements using a model checker
- scientific article; zbMATH DE number 2090152 (Why is no real title available?)
- Relational concurrent refinement. III: Traces, partial relations and automata
- Incompleteness of relational simulations in the blocking paradigm
- Relational concurrent refinement: automata
- General refinement. I: Interfaces, determinism and special refinement
- Process simulation and refinement
- Model transformations across views
- Relational concurrent refinement. II: Internal operations and outputs
- scientific article; zbMATH DE number 1949612 (Why is no real title available?)
- scientific article; zbMATH DE number 7407781 (Why is no real title available?)
- More relational concurrent refinement: traces and partial relations
- General refinement. II: Flexible refinement
- A single complete relational rule for coalgebraic refinement
- Temporal-logic property preservation under Z refinement
- A note on traces refinement and the conf relation in the unifying theories of programming
- Refinements for open automata
This page was built for publication: Unifying concurrent and relational refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844822)
