Executability of scenarios in Petri nets

DOI10.1016/J.TCS.2008.11.014zbMath1172.68044OpenAlexW2057835807MaRDI QIDQ1006647

Robert Lorenz, Gabriel Juhás, Robin Bergenthum, Jörg Desel, Sebastian Mauser

Publication date: 25 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.014

zbMATH Keywords

partial order semanticspartial ordercausal semanticsstratified order structureinhibitor netplace/transition Petri net

Mathematics Subject Classification ID

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

Related Items (3)

``Truly concurrent and nondeterministic semantics of discrete-time Petri nets ⋮ How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings ⋮ Unifying Petri Net Semantics with Token Flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Process semantics of general inhibitor nets
• Modeling concurrency with partial orders
• Finding minimum-cost flows by double scaling
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Contextual nets
• Semantics of inhibitor nets
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• The non-sequential behaviour of Petri nets
• Complete Process Semantics for Inhibitor Nets
• A new approach to the maximum-flow problem
• Improved Time Bounds for the Maximum Flow Problem
• Non sequential semantics for contextual P/T nets
• Applications and Theory of Petri Nets 2005

This page was built for publication: Executability of scenarios in Petri nets