scientific article
From MaRDI portal
Publication:3773358
zbMath0634.68061MaRDI QIDQ3773358
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Petri Net Reductions for Counting Markings ⋮ Accelerating the computation of dead and concurrent places using reductions ⋮ A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking ⋮ Computing Petri net languages by reductions ⋮ Reduction rules for reset/inhibitor nets ⋮ Mathematical programming approach to the Petri nets reachability problem ⋮ Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior ⋮ Functional equivalences of Petri nets ⋮ Proving safety properties of infinite state systems by compilation into Presburger arithmetic ⋮ Transformations in Reconfigurable Place/Transition Systems ⋮ Finding Complex Process-Structures by Exploiting the Token-Game ⋮ Reduction of Workflow Nets for Generalised Soundness Verification ⋮ Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns ⋮ Negotiation as concurrency primitive ⋮ \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems ⋮ Refinement of Synchronizable Places with Multi-workflow Nets ⋮ On the Reversibility of Well-Behaved Weighted Choice-Free Systems ⋮ Inheritance of behavior ⋮ Inheritance of workflows: An approach to tackling problems related to change ⋮ Extensible structural analysis of Petri net product lines ⋮ Reduction techniques for network validation in systems biology ⋮ Soundness-preserving reduction rules for reset workflow nets ⋮ Modular Modelling of Software Product Lines with Feature Nets ⋮ Connectivity of workflow nets: The foundations of stepwise verification ⋮ On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
This page was built for publication:
