Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities

Ernst W. Mayr, Jeremias Weihmann. Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities. In Parosh Aziz Abdulla, Igor Potapov, editors, Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. Volume 8169 of Lecture Notes in Computer Science, pages 209-221, Springer, 2013. [doi]

@inproceedings{MayrW13-0,
  title = {Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities},
  author = {Ernst W. Mayr and Jeremias Weihmann},
  year = {2013},
  doi = {10.1007/978-3-642-41036-9_19},
  url = {http://dx.doi.org/10.1007/978-3-642-41036-9_19},
  researchr = {https://researchr.org/publication/MayrW13-0},
  cites = {0},
  citedby = {0},
  pages = {209-221},
  booktitle = {Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings},
  editor = {Parosh Aziz Abdulla and Igor Potapov},
  volume = {8169},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-41035-2},
}