On process equivalence = equation solving in CCS

DOI10.1007/S10817-009-9125-XzbMath1191.68443OpenAlexW2039143500MaRDI QIDQ839034

Raúl Monroy, Alan Bundy, Ian Green

Publication date: 1 September 2009

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/410526/Bundy_Alan_OnProcessEquivalence.pdf

zbMATH Keywords

equational verification calculus of communicating systemsunique fixpoint induction

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• fc2tools
• CLAM
• Oyster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Modal logics for mobile processes
• Rippling: A heuristic for guiding inductive proofs
• Experiments with proof plans for induction
• Algebra of communicating processes with abstraction
• Type theory and concurrency
• Focus points and convergent process operators: A proof strategy for protocol verification
• Planning proofs of equations in CCS
• A structural induction theorem for processes
• Formalising a value-passing calculus in H0L

This page was built for publication: On process equivalence = equation solving in CCS