We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be implemente
d as LSGA nets up to branching ST-bisimilarity with explicit divergence.
