This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
8.12 Bibliographic Notes
B. Adsul, M. Mukund, K. Narayan Kumar, and Vasumathi Narayanan. Causal closure for MSC languages. In Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005), volume 3821 of Lecture Notes in Computer Science, pages 335–347, Hyderabad, India, 2005. Springer.
R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. IEEE Trans. Software Eng., 29(7):623–633, 2003.
B. Bollig and M. Leucker. A hierarchy of implementable MSC languages. In Proceedings of the 25th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2005), volume 3731 of Lecture Notes in Computer Science, pages 53–67, Taipei, Taiwan, ROC, 2005. Springer.
B. Bollig and M. Leucker. Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science, to appear, 2006. A preliminary version appeared in Proceedings of CONCUR 2004, volume 3170 of Lecture Notes in Computer Science, pages 146–160. Springer, 2004.
D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2), 1983.
B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Malaga, Spain, volume 2380 of Lecture Notes in Computer Science, pages 657–668. Springer, 2002.
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].
D. Kuske. Regular sets of infinite message sequence charts. Information and Computation, 187:80–109, 2003.
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.
P. S. Thiagarajan. PTL over product state spaces. Technical Report TCS-95-4, Chennai Mathematical Institute, 1995.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Communicating Finite-State Machines. In: Formal Models of Communicating Systems. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32923-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-32923-4_8
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)