Petri Net Distributability

DOI10.1007/978-3-642-29709-0_1zbMath1336.68175OpenAlexW125634580MaRDI QIDQ3457969

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)

Related Items (15)

On the Reversibility of Live Equal-Conflict Petri Nets ⋮ Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account ⋮ 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 ⋮ Unnamed Item ⋮ Distributability of mobile ambients ⋮ Synthesis of Persistent Systems ⋮ On the Reversibility of Well-Behaved Weighted Choice-Free Systems ⋮ Synthesis and reengineering of persistent systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ A two-player asynchronous game on fully observable Petri nets ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable

This page was built for publication: Petri Net Distributability