On characterising distributability
From MaRDI portal
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.
Recommendations
- On distributability
- On characterization of distributions
- On a generalization of distributivity
- Distributivity and Varlet distributivity
- Aspects of distributivity
- On a characterization of uniform distributions
- Distributivity between uninorms
- scientific article; zbMATH DE number 1160748
- scientific article; zbMATH DE number 29141
Cited in
(13)- Interval semantics for Petri nets with inhibitor arcs
- Conflict vs causality in event structures
- Ensuring liveness properties of distributed systems: open problems
- A two-player asynchronous game on fully observable Petri nets
- Abstract processes and conflicts in place/transition systems
- Synchronous and asynchronous communication(s) between three parties
- Characterising spectra of equivalences for event structures, logically
- Conflict vs causality in event structures
- Petri net distributability
- \(k\)-bounded Petri net synthesis from modal transition systems
- Modeling concurrency with interval traces
- scientific article; zbMATH DE number 7147446 (Why is no real title available?)
- On An Intriguing Distributional Identity
This page was built for publication: On characterising distributability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848362)