Bounded Reachability Checking with Process Semantics

Keijo Heljanko. Bounded Reachability Checking with Process Semantics. In Kim Guldstrand Larsen, Mogens Nielsen, editors, CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings. Volume 2154 of Lecture Notes in Computer Science, pages 218-232, Springer, 2001. [doi]

@inproceedings{Heljanko01,
  title = {Bounded Reachability Checking with Process Semantics},
  author = {Keijo Heljanko},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2154/21540218.htm},
  tags = {semantics},
  researchr = {https://researchr.org/publication/Heljanko01},
  cites = {0},
  citedby = {0},
  pages = {218-232},
  booktitle = {CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings},
  editor = {Kim Guldstrand Larsen and Mogens Nielsen},
  volume = {2154},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42497-0},
}