Publication:3773358
From MaRDI portal
zbMath0634.68061MaRDI QIDQ3773358
Publication date: 1987
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
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, Inheritance of behavior, Inheritance of workflows: An approach to tackling problems related to change, Petri Net Reductions for Counting Markings, 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, Connectivity of workflow nets: The foundations of stepwise verification, 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, Soundness-preserving reduction rules for reset workflow nets, \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Negotiation as concurrency primitive, 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, Modular Modelling of Software Product Lines with Feature Nets, Transformations in Reconfigurable Place/Transition Systems
