Correct and efficient antichain algorithms for refinement checking

DOI10.1007/978-3-030-21759-4_11MaRDI QIDQ6190187zbMATH OpenOpenAlexFDO

Authors Maurice Laveaux, Jan Friso Groote, T. A. C. Willemse

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)

Recommendations

• scientific article; zbMATH DE number 7327941
• Refinement checking based on simulation relations
• Antichain algorithms for finite automata
• Faster algorithms for alternating refinement relations
• Relational concurrent refinement

Cites work

• A branching time model of CSP
• Branching Bisimilarity with Explicit Divergence
• CCS expressions, finite state processes, and three problems of equivalence
• FDR3 -- a modern refinement checker for CSP
• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 7327941 (Why is no real title available?)
• Understanding concurrent systems
• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190187)