Partial order reduction for checking soundness of time workflow nets

DOI10.1016/j.ins.2014.06.006zbMath1355.68189OpenAlexW2094686098MaRDI QIDQ507759

Kamel Barkaoui, Hanifa Boucheneb

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.06.006

zbMATH Keywords

abstractionsoundnessstate spacepartial order reductiontime workflow net

Mathematics Subject Classification ID

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

Related Items (2)

An approach for enforcing a class of GMECs on time Petri nets with uncontrollable transitions ⋮ Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• Soundness of workflow nets: classification, decidability, and analysis
• Soundness-preserving reduction rules for reset workflow nets
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• CTL* model checking for time Petri nets
• A partial order semantics approach to the clock explosion problem of timed automata
• On soundness for time workflow nets
• Partial Order Reduction for Verification of Real-Time Components
• Can Stubborn Sets Be Optimal?
• Covering Steps Graphs of Time Petri Nets
• Formal Modeling and Analysis of Timed Systems
• On Interleaving in Timed Automata

This page was built for publication: Partial order reduction for checking soundness of time workflow nets