Analysis of Petri nets with a dynamic priority method
From MaRDI portal
Recommendations
Cites work
- A formal semantics for concurrent systems with a priority relation
- Free Choice Petri Nets
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 977553 (Why is no real title available?)
- On the analysis of Petri nets with static priorities
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Petri net semantics of priority systems
Cited in
(13)- Getting the priorities right: saturation for prioritised Petri nets
- Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
- On the analysis of Petri nets with static priorities
- Property analysis of logic Petri nets by marking reachability graphs
- Under-approximation of reachability in multivalued asynchronous networks
- Controlling Petri Net Behavior using Priorities for Transitions
- scientific article; zbMATH DE number 5014120 (Why is no real title available?)
- Generalized state equation of Petri Nets with priority
- scientific article; zbMATH DE number 2112159 (Why is no real title available?)
- scientific article; zbMATH DE number 2113981 (Why is no real title available?)
- Applications and Theory of Petri Nets 2004
- On Stubborn Sets in the Verification of Linear Time Temporal Properties
- Sufficient conditions for reachability in automata networks with priorities
This page was built for publication: Analysis of Petri nets with a dynamic priority method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487377)
