Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets

Paola Alimonti, Esteban Feuerstein, Umberto Nanni. Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. In Imre Simon, editor, LATIN 92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings. Volume 583 of Lecture Notes in Computer Science, pages 1-14, Springer, 1992.

@inproceedings{AlimontiFN92,
  title = {Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets},
  author = {Paola Alimonti and Esteban Feuerstein and Umberto Nanni},
  year = {1992},
  researchr = {https://researchr.org/publication/AlimontiFN92},
  cites = {0},
  citedby = {0},
  pages = {1-14},
  booktitle = {LATIN  92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings},
  editor = {Imre Simon},
  volume = {583},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-55284-7},
}