The following pages link to (Q3773358):
Displaying 15 items.
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Mathematical programming approach to the Petri nets reachability problem (Q856211) (← links)
- Soundness-preserving reduction rules for reset workflow nets (Q1007883) (← links)
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems (Q1191025) (← links)
- Negotiation as concurrency primitive (Q1731828) (← links)
- Reduction techniques for network validation in systems biology (Q1790877) (← links)
- Extensible structural analysis of Petri net product lines (Q2032833) (← links)
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets (Q2117166) (← links)
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior (Q2165244) (← links)
- Reduction of Workflow Nets for Generalised Soundness Verification (Q2961558) (← links)
- Refinement of Synchronizable Places with Multi-workflow Nets (Q3011886) (← links)
- Modular Modelling of Software Product Lines with Feature Nets (Q3095246) (← links)
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns (Q6189320) (← links)
