Handbook of theoretical computer science (vol. B)
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Superposition Refinement of Parallel Algorithms
FORTE '91 Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, IV
Trace Refinement of Action Systems
CONCUR '94 Proceedings of the Concurrency Theory
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Refinement of Parallel and Reactive Programs
Refinement of Parallel and Reactive Programs
Using the Alloy Analyzer to Verify Data Refinement in Z
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Downward Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic refinement checking for b
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
| Hi-index | 0.00 |
Action systems provide a formal approach to modelling parallel and reactive systems. They have a well established theory of refinement supported by simulation-based proof rules. This paper introduces an automatic approach for verifying action system refinements utilising standard CTL model checking. To do this, we encode each of the simulation conditions as a simulation machine, a Kripke structure on which the proof obligation can be discharged by checking that an associated CTL property holds. This procedure transforms each simulation condition into a model checking problem. Each simulation condition can then be model checked in isolation, or, if desired, together with the other simulation conditions by combining the simulation machines and the CTL properties.