On Characterising Distributability

Abstract

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 implemented as LSGA nets up to branching ST-bisimilarity with explicit divergence.

arXiv admin note: substantial text overlap with arXiv:1207.3597

References in corpus (3)

• Abstract Processes of Place/Transition Systems
• On Synchronous and Asynchronous Interaction in Distributed Systems
• On Distributability of Petri Nets

Cited by in corpus (7)

• Ensuring Liveness Properties of Distributed Systems: Open Problems
• Ensuring Liveness Properties of Distributed Systems (A Research Agenda)
• Justness: A Completeness Criterion for Capturing Liveness Properties
• Concurrency and Probability: Removing Confusion, Compositionally
• Abstract Processes and Conflicts in Place/Transition Systems
• Conflict vs Causality in Event Structures
• Asynchronous games on Petri nets and ATL