Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms

Ernst W. Mayr, Jeremias Weihmann. Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms. Fundamenta Informaticae, 137(1):61-86, 2015. [doi]

@article{MayrW15,
  title = {Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms},
  author = {Ernst W. Mayr and Jeremias Weihmann},
  year = {2015},
  doi = {10.3233/FI-2015-1170},
  url = {http://dx.doi.org/10.3233/FI-2015-1170},
  researchr = {https://researchr.org/publication/MayrW15},
  cites = {0},
  citedby = {0},
  journal = {Fundamenta Informaticae},
  volume = {137},
  number = {1},
  pages = {61-86},
}