A Hierarchy of Implementable MSC Languages

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.

[1]  Anca Muscholl,et al.  A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms , 2004, Developments in Language Theory.

[2]  Madhavan Mukund,et al.  Regular Collections of Message Sequence Charts , 2000, MFCS.

[3]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[4]  Dietrich Kuske,et al.  A Further Step towards a Theory of Regular MSC Languages , 2002, STACS.

[5]  Madhavan Mukund,et al.  A theory of regular MSC languages , 2005, Inf. Comput..

[6]  Anca Muscholl,et al.  Infinite-state high-level MSCs: Model-checking and realizability , 2002, J. Comput. Syst. Sci..

[7]  Dietrich Kuske,et al.  Regular sets of infinite message sequence charts , 2003, Inf. Comput..

[8]  P. S. Thiagarajan,et al.  A Trace Consistent Subset of PTL , 1995, CONCUR.

[9]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[10]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[11]  Rémi Morin,et al.  Recognizable Sets of Message Sequence Charts , 2002, STACS.

[12]  Rajeev Alur,et al.  Inference of message sequence charts , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[13]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[14]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.