Modal logic and the approximation induction principle

DOI10.1017/S0960129511000387zbMath1260.68266MaRDI QIDQ2883116

Maciej Gazda, W. J. Fokkink

Publication date: 11 May 2012

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

modal logicbisimulationsprocess equivalenceHennessy-Milner theoremapproximation induction principlefinite preorders

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ Divergence and unique solution of equations

Cites Work

• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• On the consistency of Koomen's fair abstraction rule
• Turning SOS rules into equations
• Correcting a Space-Efficient Simulation Algorithm
• Algebraic laws for nondeterminism and concurrency
• Process Algebra
• Precongruence formats for decorated trace semantics