Complexity as a Basis for Comparing Semantic Models of Concurrency

Alan Mycroft, Pierpaolo Degano, Corrado Priami. Complexity as a Basis for Comparing Semantic Models of Concurrency. In Kanchana Kanchanasut, Jean-Jacques Lévy, editors, Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC 95, Pathumthani, Tailand, December 11-13, 1995, Proceedings. Volume 1023 of Lecture Notes in Computer Science, pages 141-155, Springer, 1995.

@inproceedings{MycroftDP95,
  title = {Complexity as a Basis for Comparing Semantic Models of Concurrency},
  author = {Alan Mycroft and Pierpaolo Degano and Corrado Priami},
  year = {1995},
  researchr = {https://researchr.org/publication/MycroftDP95},
  cites = {0},
  citedby = {0},
  pages = {141-155},
  booktitle = {Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC  95, Pathumthani, Tailand, December 11-13, 1995, Proceedings},
  editor = {Kanchana Kanchanasut and Jean-Jacques Lévy},
  volume = {1023},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-60688-2},
}