Petri net distributability

DOI10.1007/978-3-642-29709-0_1MaRDI QIDQ3457969zbMATH OpenOpenAlexFDO

Authors Eike Best, Philippe Darondeau

Publication date 7 December 2015

Published in Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29709-0_1

Mathematics Subject Classification ID

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

Recommendations

• On Distributability of Petri Nets
• Distributing finite automata through Petri net synthesis
• On characterising distributability
• scientific article; zbMATH DE number 3982529
• scientific article; zbMATH DE number 1973117

Cited in

(17)

• Bounded choice-free Petri net synthesis: algorithmic issues
• Distributing finite automata through Petri net synthesis
• A two-player asynchronous game on fully observable Petri nets
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
• Distributability of mobile ambients
• Synthesis and reengineering of persistent systems
• The power of prime cycles
• Petri Net Synthesis for Restricted Classes of Nets
• On Distributability of Petri Nets
• On the Reversibility of Live Equal-Conflict Petri Nets
• On the distributability of mobile ambients
• Automatic decomposition of Petri nets into automata networks -- a synthetic account
• \(k\)-bounded Petri net synthesis from modal transition systems
• Synthesis of Persistent Systems
• On the reversibility of well-behaved weighted choice-free systems
• Articulation of Transition Systems and Its Application to Petri Net Synthesis
• Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets

This page was built for publication: Petri net distributability

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