Branching bisimilarity is a notion of behavioral equivalence between processes. To prove that two processes are branching bisimilar one should provide a relation (a set of pairs) containing the two processes, such that the relation satisfies some properties. For recursive processes this relation often becomes infinite and complicated, which may lead to awkward and long …continue reading

We discuss an extension of the coordination modelling language Paradigm. The extension is geared towards data-dependent interaction among components, where the coordination is influenced by possibly distributed data. The approach is illustrated by the well-known example of a bakery where tickets are issued to serve clients in order. Also, it is described how to encode …continue reading