On liveness and deadlockability in subclasses of weighted Petri nets

DOI10.1007/978-3-319-57861-3_16zbMath1393.68119OpenAlexW2611001520MaRDI QIDQ1662542

Raymond Devillers, Thomas Hujsa

Publication date: 20 August 2018

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

zbMATH Keywords

monotonicityboundednesslivenessstructural analysiscommunication-freeasymmetric choicedeadlockabilityfork attributionjoin-freesynchronization-freeweighted Petri net

Mathematics Subject Classification ID

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

Related Items (1)

Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond

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