On liveness and deadlockability in subclasses of weighted Petri nets

DOI10.1007/978-3-319-57861-3_16MaRDI QIDQ1662542zbMATH OpenOpenAlexFDO

Authors Thomas Hujsa, Raymond Devillers

Publication date 20 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-57861-3_16

zbMATH Keywords

asymmetric choiceboundednesscommunication-freedeadlockabilityfork attributionjoin-freelivenessmonotonicitystructural analysissynchronization-freeweighted Petri net

Mathematics Subject Classification ID

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

Recommendations

• On deadlockability, liveness and reversibility in subclasses of weighted Petri nets
• Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties
• Applications and Theory of Petri Nets 2005
• On liveness and reversibility of equal-conflict Petri nets
• Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait

Cited in

(7)

• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait
• scientific article; zbMATH DE number 522844 (Why is no real title available?)
• On deadlockability, liveness and reversibility in subclasses of weighted Petri nets
• On liveness and reversibility of equal-conflict Petri nets
• Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties
• Applications and Theory of Petri Nets 2005

This page was built for publication: On liveness and deadlockability in subclasses of weighted Petri nets

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