Correct and efficient antichain algorithms for refinement checking

DOI10.1007/978-3-030-21759-4_11OpenAlexW2917543733MaRDI QIDQ6190187

Tim A. C. Willemse, Jan Friso Groote, Maurice Laveaux

Publication date: 6 February 2024

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21759-4_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• A branching time model of CSP
• Understanding concurrent systems
• Branching Bisimilarity with Explicit Divergence
• When Simulation Meets Antichains
• FDR3 — A Modern Refinement Checker for CSP

This page was built for publication: Correct and efficient antichain algorithms for refinement checking