Getting the priorities right: saturation for prioritised Petri nets

DOI10.1007/978-3-319-57861-3_14zbMATH Open1393.68121OpenAlexW2610660442MaRDI QIDQ1662541FDOQ1662541

Authors: Kristóf Marussy, Vince Molnár, András Vörös, István Majzik 

Publication date: 20 August 2018

Full work available at URL: http://real.mtak.hu/57608/1/main.pdf

Recommendations

• On the analysis of Petri nets with static priorities
• scientific article; zbMATH DE number 763717
• Model Checking Bounded Prioritized Time Petri Nets
• Ten years of saturation: a Petri net perspective
• Analysis of Petri nets with a dynamic priority method

zbMATH Keywords

saturationpriorityPetri netdecision diagramedge-valued interval decision diagramGSPNprioritised Petri net

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Saturation Enhanced with Conditional Locality: Application to Petri Nets
• Controlling Petri Net Behavior using Priorities for Transitions
• On the analysis of Petri nets with static priorities
• Ten years of saturation: a Petri net perspective

This page was built for publication: Getting the priorities right: saturation for prioritised Petri nets

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