Deriving Unbounded Petri Nets from Formal Languages

Philippe Darondeau. Deriving Unbounded Petri Nets from Formal Languages. In Davide Sangiorgi, Robert de Simone, editors, CONCUR 98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, Proceedings. Volume 1466 of Lecture Notes in Computer Science, pages 533-548, Springer, 1998. [doi]

@inproceedings{Darondeau98,
  title = {Deriving Unbounded Petri Nets from Formal Languages},
  author = {Philippe Darondeau},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1466/14660533.htm},
  researchr = {https://researchr.org/publication/Darondeau98},
  cites = {0},
  citedby = {0},
  pages = {533-548},
  booktitle = {CONCUR  98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, Proceedings},
  editor = {Davide Sangiorgi and Robert de Simone},
  volume = {1466},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-64896-8},
}