Distribution of Behaviour into Parallel Communicating Subsystems

Omar al Duhaiby
(Eindhoven University of Technology)
Jan Friso Groote
(Eindhoven University of Technology)

The process of decomposing a complex system into simpler subsystems has been of interest to computer scientists over many decades, for instance, for the field of distributed computing. In this paper, motivated by the desire to distribute the process of active automata learning onto multiple subsystems, we study the equivalence between a system and the total behaviour of its decomposition which comprises subsystems with communication between them. We show synchronously- and asynchronously-communicating decompositions that maintain branching bisimilarity, and we prove that there is no decomposition operator that maintains divergence-preserving branching bisimilarity over all LTSs.

In Jorge A. Pérez and Jurriaan Rot: Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics (EXPRESS/SOS 2019), Amsterdam, The Netherlands, 26th August 2019, Electronic Proceedings in Theoretical Computer Science 300, pp. 54–68.
Published: 22nd August 2019.

ArXived at: https://dx.doi.org/10.4204/EPTCS.300.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org