Universal axioms for bisimulations (original) (raw)

Node-labelled graphs, called observation structures, are introduced as a basic model of concurrent distributed systems and as a framework for dealing with observational equivalences over them. A new bisimulation, called jumping bisimulation, is defined, with sound and complete axiomatizations that are independent of the chosen observations. The paper demonstrates how many bisimulation-based congruences from the literature can be reformulated within this framework, enabling a structured approach to defining the extensional semantics of process description languages. Future work is suggested to explore additional operators on observation trees and to further investigate testing/refusal-based equivalences.