Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
From MaRDI portal
Publication:3591399
DOI10.1007/11804192_10zbMath1196.68156MaRDI QIDQ3591399
Paulien de Wind, Robert J. van Glabbeek, W. J. Fokkink
Publication date: 11 September 2007
Published in: Formal Methods for Components and Objects (Search for Journal in Brave)
Full work available at URL: https://unsworks.unsw.edu.au/fapi/datastream/unsworks:7774/SOURCE01?view=true
03B45: Modal logic (including the logic of norms)
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Divide and congruence III: Stability & divergence, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, On cool congruence formats for weak bisimulations, A precongruence format for should testing preorder, Characteristic invariants in Hennessy-Milner logic, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, Notes on Generative Probabilistic Bisimulation