Reduction rules for reset/inhibitor nets
From MaRDI portal
Publication:847264
Recommendations
Cites work
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- scientific article; zbMATH DE number 4033100 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3557247 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1405652 (Why is no real title available?)
- Analysis issues in Petri nets with inhibitor arcs
- Free Choice Petri Nets
- Lectures on Concurrency and Petri Nets
- Monotonic extensions of Petri nets: forward and backward search revisited
- Reachability in Petri nets with inhibitor arcs
- Reduction rules for time Petri nets
- Well-structured transition systems everywhere!
Cited in
(5)- Discovery, Verification and Conformance of Workflows with Cancellation
- Connectivity of workflow nets: The foundations of stepwise verification
- Soundness of workflow nets: classification, decidability, and analysis
- Soundness-preserving reduction rules for reset workflow nets
- Transforming dynamic condition response graphs to safe Petri nets
This page was built for publication: Reduction rules for reset/inhibitor nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847264)