Slicing Petri Nets with an Application to Workflow Verification

DOI10.1007/978-3-540-77566-9_38zbMath1133.68060OpenAlexW103510418MaRDI QIDQ5448670

Astrid Rakow

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_38

zbMATH Keywords

VerificationSlicingCTL\(^{*}_{\text{-X}}\)Net ReductionWorkflow nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Maximal and Minimal Dynamic Petri Net Slicing ⋮ Actor-based slicing techniques for efficient reduction of Rebeca models ⋮ Decompositional Petri Net Reductions ⋮ Dynamic Slicing of Petri Nets Based on Structural Dependency Graph and its Application in System Analysis ⋮ Dynamic Slicing Techniques for Petri Nets ⋮ Next-preserving branching bisimulation

This page was built for publication: Slicing Petri Nets with an Application to Workflow Verification