On distributability of petri nets

Authors:
Rob van Glabbeek;Ursula Goltz;Jens-Wolfhard Schicke-Uffmann
Affiliations:
NICTA, Sydney, Australia and School of Computer Sc. and Engineering, University of New South Wales, Sydney, Australia;Institute for Programming and Reactive Systems, TU Braunschweig, Germany;Institute for Programming and Reactive Systems, TU Braunschweig, Germany
Venue:
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Year:
2012

Citing 9
Cited 1

Specification-oriented semantics for communicating processes

Acta Informatica
Petri net models for algebraic theories of concurrency

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Bisimulation and action refinement

Selected papers of the 3rd workshop on Concurrency and compositionality
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Distributable nets

Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
On Synchronous and Asynchronous Interaction in Distributed Systems

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Abstract processes of place/transition systems

Information Processing Letters
Petri net distributability

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics

On distributability in process calculi

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

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.