Abstract
We develop a unifying theory of message-passing automata (MPAs) and MSC languages. We study several variants of regular as well as product MSC languages, their closure under finite union and their intersection. Furthermore, we analyse the expressive power of several variants of MPAs and characterize the language classes of interest by the corresponding classes of MPAs.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alur, R., Etessami, K., Yannakakis, M.: Inference of Message Sequence Charts. In: Proceedings of the 22nd International Conference on Software Engineering. ACM Press, New York (2000)
Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 146–160. Springer, Heidelberg (2004)
Genest, B., Muscholl, A., Kuske, D.: A kleene theorem for a class of communicating automata with effective algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 30–48. Springer, Heidelberg (2004)
Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level mSCs: Model-checking and realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 657. Springer, Heidelberg (2002)
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Information and Computation (2004) (to appear)
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Regular collections of message sequence charts. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, p. 405. Springer, Heidelberg (2000)
ITU-TS Recommendation Z.120: Message Sequence Chart 1999, MSC 1999 (1999)
Kuske, D.: A further step towards a theory of regular MSC languages. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, p. 489. Springer, Heidelberg (2002)
Kuske, D.: Regular Sets of Infinite Message Sequence Charts. Information and Computation 187, 80–109 (2003)
Morin, R.: Recognizable sets of message sequence charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, p. 523. Springer, Heidelberg (2002)
Thiagarajan, P.S.: A trace consistent subset of PTL. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bollig, B., Leucker, M. (2005). A Hierarchy of Implementable MSC Languages. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_6
Download citation
DOI: https://doi.org/10.1007/11562436_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)