Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Arbitration-free synchronization
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of Computer and System Sciences
Separability in persistent petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
On distributability of petri nets
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Hi-index | 0.00 |
A Petri net is distributed if, given an allocation of transitions to (geographical) locations, no two transitions at different locations share a common input place. A system is distributable if there is some distributed Petri net implementing it. This paper addresses the question of which systems can be distributed, while respecting a given allocation. The paper states the problem formally and discusses several examples illuminating --- to the best of the authors' knowledge --- the current status of this work.