Compositional CSP traces refinement checking
From MaRDI portal
Publication:5178982
Recommendations
Cites work
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 1903348 (Why is no real title available?)
- 25 years of model checking. History, achievements, perspectives
- Communicating sequential processes
- Concurrency verification. Introduction to compositional and noncompositional methods
- Inference of finite automata using homing sequences
- Insights to Angluin's learning
- Learning regular sets from queries and counterexamples
- Proofs of Networks of Processes
- Using partial orders for the efficient verification of deadlock freedom and safety properties
Cited in
(3)
This page was built for publication: Compositional CSP traces refinement checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178982)