Markus Lohrey. Safe Realizability of High-Level Message Sequence Charts. In Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera, editors, CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Volume 2421 of Lecture Notes in Computer Science, pages 177-192, Springer, 2002. [doi]
@inproceedings{Lohrey02,
title = {Safe Realizability of High-Level Message Sequence Charts},
author = {Markus Lohrey},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2421/24210177.htm},
researchr = {https://researchr.org/publication/Lohrey02},
cites = {0},
citedby = {0},
pages = {177-192},
booktitle = {CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings},
editor = {Lubos Brim and Petr Jancar and Mojmír Kretínský and Antonín Kucera},
volume = {2421},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-44043-7},
}