On Distributability of Petri Nets

DOI10.1007/978-3-642-28729-9_22MaRDI QIDQ2892781zbMATH OpenOpenAlexFDO

Authors Ursula Goltz, Jens-Wolfhard Schicke-Uffmann, Rob van Glabbeek

Publication date 22 June 2012

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.3597

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

• Petri net distributability
• Foundations of Software Science and Computation Structures
• Distributing finite automata through Petri net synthesis
• scientific article; zbMATH DE number 1614642
• scientific article; zbMATH DE number 1173911
• scientific article; zbMATH DE number 1106703
• Petri nets and semilinear sets (extended abstract)
• scientific article; zbMATH DE number 2081112

Cited in

(17)

• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• Associative composition of components with double-sided interfaces
• Bounded choice-free Petri net synthesis: algorithmic issues
• Distributability of mobile ambients
• Synthesis and reengineering of persistent systems
• The power of prime cycles
• Synchrony versus causality in distributed systems
• scientific article; zbMATH DE number 3870604 (Why is no real title available?)
• On the distributability of mobile ambients
• Petri net distributability
• On Synchronous and Asynchronous Interaction in Distributed Systems
• scientific article; zbMATH DE number 2013783 (Why is no real title available?)
• scientific article; zbMATH DE number 2081112 (Why is no real title available?)
• Automatic decomposition of Petri nets into automata networks -- a synthetic account
• Symmetric and asymmetric asynchronous interaction
• On clock interval automata for a class of time PNs
• Separation and encodability in mixed choice multiparty sessions

This page was built for publication: On Distributability of Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892781)