This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
9.7 Bibliographic Notes
B. Genest, D. Kuske, and A. Muscholl. A Kleene theorem for a class of communicating automata with effective algorithms. In Proceedings of the 8th International Conference on Developments in Language Theory (DLT 2004), Auckland, New Zealand, volume 3340 of Lecture Notes in Computer Science, pages 30–48. Springer, 2004.
J. G. Henriksen, M. Mukund, K. Narayan Kumar, M. Sohoni, and P. S. Thiagarajan. A theory of regular MSC languages. Information and Computation, 202(1):1–38, 2005. The paper subsumes results from [46, 47, 74].
O. Matz, N. Schweikardt, and W. Thomas. The monadic quantifier alternation hierarchy over grids and graphs. Information and Computation, 179(2):356–383, 2002.
O. Matz and W. Thomas. The monadic quantifier alternation hierarchy over graphs is infinite. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS 1997), Warsaw, Poland, pages 236–244. IEEE Computer Society Press, 1997.
R. Morin. Recognizable sets of message sequence charts. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002), Antibes — Juan les Pins, France, volume 2285 of Lecture Notes in Computer Science, pages 523–534. Springer, 2002.
W. Thomas. Automata theory on trees and partial orders. In Proceedings of TAPSOFT 1997: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, volume 1214 of Lecture Notes in Computer Science, pages 20–38. Springer, 1997.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Beyond Implementability. In: Formal Models of Communicating Systems. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32923-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-32923-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32922-0
Online ISBN: 978-3-540-32923-7
eBook Packages: Computer ScienceComputer Science (R0)