scientific article; zbMATH DE number 4033100
From MaRDI portal
Publication:3773358
Recommendations
Cited in
(35)- Soundness-preserving reduction rules for reset workflow nets
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- Declarative operations on nets
- Reduction techniques for network validation in systems biology
- Extensible structural analysis of Petri net product lines
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
- Reduction of workflow nets for generalised soundness verification
- Refinement of synchronizable places with multi-workflow nets. Weak termination preserved!
- Modular modelling of software product lines with feature nets
- scientific article; zbMATH DE number 1004242 (Why is no real title available?)
- Transformations in Reconfigurable Place/Transition Systems
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- scientific article; zbMATH DE number 3990881 (Why is no real title available?)
- scientific article; zbMATH DE number 140242 (Why is no real title available?)
- scientific article; zbMATH DE number 1173830 (Why is no real title available?)
- Decomposition of Elementary Transvection in Elementary Net Group
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
- Computing Petri net languages by reductions
- Functional equivalences of Petri nets
- On the reversibility of well-behaved weighted choice-free systems
- Applications and Theory of Petri Nets 2005
- Petri Net Reductions for Counting Markings
- Decomposing service definition in predicate/transition-nets for designing distributed systems
- Inheritance of behavior
- Inheritance of workflows: An approach to tackling problems related to change
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic
- Finding Complex Process-Structures by Exploiting the Token-Game
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
- Automated polyhedral abstraction proving
- Connectivity of workflow nets: The foundations of stepwise verification
- On Desarguesian extensions of elation nets
- Accelerating the computation of dead and concurrent places using reductions
- Reduction rules for reset/inhibitor nets
- Mathematical programming approach to the Petri nets reachability problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773358)
