Decidability of k -Soundness for Workflow Nets with an Unbounded Resource

Vladimir A. Bashkin, Irina A. Lomazova. Decidability of k -Soundness for Workflow Nets with an Unbounded Resource. T. Petri Nets and Other Models of Concurrency, 9:1-18, 2014. [doi]

@article{BashkinL14,
  title = {Decidability of k -Soundness for Workflow Nets with an Unbounded Resource},
  author = {Vladimir A. Bashkin and Irina A. Lomazova},
  year = {2014},
  doi = {10.1007/978-3-662-45730-6_1},
  url = {http://dx.doi.org/10.1007/978-3-662-45730-6_1},
  researchr = {https://researchr.org/publication/BashkinL14},
  cites = {0},
  citedby = {0},
  journal = {T. Petri Nets and Other Models of Concurrency},
  volume = {9},
  pages = {1-18},
}