Complexity of the soundness problem of workflow nets
Classical workflow nets (WF-nets for short) are an important subclass of Petri nets that are widely used to model and analyze workflow systems. Soundness is a crucial property of workflow systems and guarantees that these systems are deadlock-free and bounded. Aalst et al. proved that the soundness...
Saved in:
Main Authors: | LIU, Guan Jun, SUN, Jun, LIU, Yang, DONG, Jin Song |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4979 https://ink.library.smu.edu.sg/context/sis_research/article/5982/viewcontent/pn12.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Complexity of the soundness problem of bounded workflow nets
by: LIU, Guan Jun, et al.
Published: (2012) -
Integrating specification and programs for system modeling and verification
by: SUN, Jun, et al.
Published: (2009) -
Model checking approach to automated planning
by: LI, Yi, et al.
Published: (2014) -
Towards expressive specification and efficient model checking
by: DONG, Jin Song, et al.
Published: (2009) -
CELL: A compositional verification framework
by: JI, Kun, et al.
Published: (2013)